Data Structure MCQ
Data Structure MCQ | Question For competitive examination and interviews In this post, we have given questions and answers related to the data structure, you can also see the answer to the question along with four options for a question. To see the correct answer, one has to click on the View Answer.
data structure MCQ online test | data structure quiz | data structure MCQ with answer | data structure questions and answers pdf.
Data Structure Objective Question Answer
1. Which of the following sorting algorithms divide-and-conquer type?
- Bubble sort
- Insertion sort
- Quick sort
- All of the above
2. Which of the following data structure is a linear data structure?
- Trees
- Graphs
- Arrays
- None of the above
3. Which data structure allows deleting data elements from front and inserting at the rear?
- Stacks
- Queues
- Deques
- Binary search tree
4. The operation of processing each element in the list is known as
- Sorting
- Merging
- Inserting
- Traversal
5. Which of the following is not the type of queue?
- Ordinary queue
- Single-ended queue
- Circular queue
- Priority queue
6. How many nodes does a binomial tree of the order have?
- 0
- 1
- 2
- 3
7. Quicksort is faster than
- Selection sort
- Insertion sort
- Bubble sort
- All of these
8. Which type of linked does not store NULL in the next field?
- Singly-linked list
- Doubly linked list
- Circular linked list
- All of these
9. Disk piled up one above the other represent a
- Stacks
- Queues
- Linked list
- Array
10. Major operation performed on Data Structures are
- Sorting
- Searching
- Inserting
- All the above
11. Arranging elements of an array in a specific order is called
- Sorting
- searching
- Inserting
- Traversing
12. Processing all the elements of an array is called.
- Insertion
- Sorting
- Deletion
- Traversing
13. Which of the following data structures are indexed structures?
- Linear arrays
- Linked list
- Queue
- Stack
14. LIFO means
- Last In First Out
- Last In Fast Overflow
- Last In First Overflow
- None of the above
15. FIFO means
- First In First Out
- Fast In Fast Out
- Fast In First Out
- First In Fast Out
16. Which of the following data structures cant store the non-homogeneous data elements?
- Arrays
- Pointers
- Records
- None
17. A stack is a …….. data Structure.
- Dynamic
- Linear ‘
- Non-dynamic
- None of the above
18. Queue is work as.
- FIFO
- LIFO
- Both a and b
- None of the above
19. Elements can be added or removed at both ends is called
- Queue
- Deque
- Circular Queue
- All the above
20. Stack is work as.
- FIFO
- LIFO
- Both a and b
- None of the above
21. Deleting from an empty list is known as.
- Overflow
- Underflow
- Both (a) and (b)
- None of the above
22. A line in a grocery store represents a
- Stacks
- Linked list
- Queues
- Array
23. In a queue, insertion is done at.
- Rear
- Front
- Both (a) and (b)
- none of the above
24. Which data structure allows deleting data elements from front and inserting at the rear?
- Stacks
- Deques
- Queues
- Binary search tree
25. Which of the following data structure is non-linear type?
- Strings
- Stacks
- Lists
- None of above
26. Beginning address of an array is called
- Base Address
- Top Address
- Both (a) & (b)
- None of the above
27. Transform prefix operation /- + A*BCD * EF to an infix form
- (A + B * C – D) /E * F
- (A+ B – C / D) * E *F
- (A + B – C * D) /E * F
- None of the above
28. Transform infix operation (A+ B * C- D) /E * F to an postfix form
- A B C+ * D – EF */
- A B C* + D – EF * /
- A B C * + D – EF / *
- None of the above