Data Structure MCQs
1. A queue follows___________?
a) LIFO principle
b) FIFO principle
c) Ordered array
d) Linear tree
2. FIFO stands for_____________ ?
a) Fast In Fast Out
b) First In First Out
c) Fast In First Out
d) First In Fast Out
3. Stack works as___________?
a) FIFO
b) LIFO
c) Both a & b
d) None of these
4. LIFO means_____________?
a) Last In First Out
b) Last In First Over
c) Last In Fast Over
d) Last In Fast Out
5. Major operation performed on Data Structures are____________
a) Sorting
b) Searching
c) Inserting
d) All of these
6. How many Queues are required to implement a Stack?
a) 1
b) 2
c) 3
d) 4
7. Process of inserting an element in stack is called?
a) Add
b) Push
c) Insert
d) None of these
8. Process of removing an element from stack is called?
a) Pop
b) Push
c) Create
d) Evaluation
9. Which of these operation can perform with stack?
a) Push
b) Pop
c) Peek
d) All of these
10. A stack is a_____________ data structure
a) Linear
b) Dynamic
c) Non-dynamic
d) None of the above
11. Processing all the elements of an array is called?
a) Sorting
b) Searching
c) Traversing
d) Inserting
12. The element are inserted in a queue from the end, called?
a) Top
b) Middle
c) Front
d) Rear
13. Which data structure allows deleting data elements from front and inserting at rear?
a) Stacks
b) Queues
c) Deques
d) Binary search tree
14. Elements can be added or removed at both end is called?
a) Queue
b) Deque
c) Circular queue
d) All of the above
15. A data structure that can store related information of different data type together is called as________?
a) Array
b) String
c) Structure
d) None of these
16. Which of the following sorting algorithm is of divide-and-conquer type?
a) Quick sort
b) Bubble sort
c) Insertion sort
d) All of the above
17. Which type of linked list does not store null in the next field?
a) Single linked list
b) Double linked list
c) Circular linked list
d) None of the above
18. Quick sort is faster than________
a) Bubble sort
b) Selection sort
c) Insertion sort
d) All of these
19. Binary search uses___________
a) Heuristic search
b) Greedy approach
c) Back tracking approach
d) Divide and conquer method
20. Beginning address of an array is called?
a) Base address
b) Top address
c) Both a and b
d) None of these
21. The individual elements in an array are called?
a) Identifier
b) Encrypted
c) Decrypted
d) Subscripted
22. Finding the location of the element with a given value is_____________?
a) Traversal
b) Search
c) Sort
d) None
23. Arranging elements of an array in specific order is called?
a) Sorting
b) Deletion
c) Insertion
d) Traversing
24. Which of the following data structures is liner data structure?
a) Trees
b) Arrays
c) Graphs
d) None of these
25. Which of the following data structures is non-liner type?
a) Lists
b) Stacks
c) Strings
d) None of these
26. Which of the following data structure can’t store the non-homogeneous data elements?
a) Arrays
b) Records
c) Pointers
d) None of the above
27. A linked is a collection of data element, called?
a) Array
b) Nodes
c) Pointer
d) All of these
28. In a queue, deletion is done at____________?
a) Rear
b) Front
c) Both a & b
d) None
29. In a queue, insertion is done at__________?
a) Rear
b) Front
c) Both a & b
d) None
30. How many conceptual views can be in a database?
a) 0
b) 1
c) 2
d) 3
31. How can we describe an array in the best possible way ?
a) Arrays are immutable
b) The Array shows a hierarchical structure
c) Container that stores the elements of similar types
d) The Array is not a data structure
32. The operation of processing each element in the list is knows as_________?
a) Traversal
b) Sorting
c) Merging
d) Inserting
33. The tango tree is a type of ?
a) K-ary Tree
b) Binary Search Tree
c) Ternary Tree
d) AVL Tree
34. In an AA-tree, we can remove a left horizontal link by_________
a) inserting a new element
b) deleting both the elements
c) performing right rotation
d) performing left rotation
35. Which data structure is best for implementing priority queue?
a) Array
b) Stack
c) Linked list
d) Heap
36. When the user tries to remove an element from the empty stack the condition is called ?
a) Overflow
b) Underflow
c) Garbage collection
d) None of these
37. If the stack size is 10 and we try to add 11th element to the stack then the position is known as______?
a) Overflow
b) Underflow
c) Garbage collection
d) None of these
38. Which data structure is mainly used to implement recursive algorithm?
a) Binary tree
b) Linked list
c) Queue
d) Stack
39. We can use a self-balancing binary search tree for implementing the__________?
a) Hash table
b) Priority queue
c) Heap sort and Priority queue
d) Heap sort
40. Which of the following is an advantage of array data structure?
a) Elements of an array cannot be sorted
b) Elements of mixed data types can be stored
c) Easier to access the elements in an array
d) Index of the first element starts from 1
41. Which of the following is a disadvantage of Array?
a) Stack and Queue data structures can be implemented through an array
b) Index of the first element in an array can be negative
c) Elements can be accessed sequentially
d) Wastage of memory if the elements inserted in an array are lesser than the allocated size
42. Which data structure is required to convert the infix to prefix notation?
a) Stack
b) Queue
c) Linked list
d) Binary tree
43. What is another name for the circular queue among the following options?
a) Ring buffer
b) Square buffer
c) Rectangle buffer
d) None of these
44. Which one of the following is not a type of queue ?
a) Linear Queue
b) Circular Queue
c) Single ended Queue
d) Double ended Queue
45. Which of the following statement is not correct for stack data structure?
a) Stack follows FIFO
b) Elements are stored in a sequential manner
c) Top of the stack contains the last inserted element
d) Arrays can be used to implement the stack