Data Structures and Algorithms MCQs - SET 3
Total Question: 20 Time: 30 minutes
Total Marks: 20
1. Which of the following data structure can’t store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks
2. A ……. is a data structure that organizes data similar to a line in the supermarket, where the
first one in line is the first one out.
A) Queue linked list
B) Stacks linked list
C) Both of them
D) Neither of them
3. Which of the following is non-liner data structure?
A) Stacks
B) List
C) Strings
D) Trees
4. Herder node is used as sentinel in ….
A) Graphs
B) Stacks
C) Binary tree
D) Queues
1|Page
5. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array
6. Identify the data structure which allows deletions at both ends of the list but insertion at
only one end.
A) Input restricted dequeue
B) Output restricted dequeue
C) Priority queues
D) Stack
7. Which of the following data structure is non-linear type?
A) Strings
B) Lists
C) Stacks
D) Graph
8. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack
9. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph
2|Page
10. A directed graph is ………………. if there is a path from each vertex to every other vertex in
the digraph.
A) Weakly connected
B) Strongly Connected
C) Tightly Connected
D) Linearly Connected
11. Which if the following is/are the levels of implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
12. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is
called ……
A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above
13. ………………. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
14. Stack is also called as
A) Last in first out
B) First in last out
C) Last in last out
D) First in first out
3|Page
15. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
16. Which of the following is not the part of ADT description?
A) Data
B) Operations
C) Both of the above
D) None of the above
17. Inserting an item into the stack when stack is not full is called …………. Operation and
deletion of item form the stack, when stack is not empty is called ………. operation.
A) push, pop
B) pop, push
C) insert, delete
D) delete, insert
18. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
D) None of the above
19. ………… is very useful in situation when data must store and then retrieved in reverse
order.
A) Stack
B) Queue
C) List
D) Link list
4|Page
20. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree
5|Page
