Top 150+ Solved Data Structure (DS) MCQ Questions Answer
Q. 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
Q. 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
Q. 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
Q. …………… is not the component of data structure.
a. operations
b. storage structures
c. algorithms
d. none of above
Q. 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
Q. ……………. 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
Q. ………… is very useful in situation when data have to stored and then retrieved in reverse order.
a. stack
b. queue
c. list
d. link list
Q. Which data structure allows deleting data elements from and inserting at rear?
a. stacks
b. queues
c. dequeues
d. binary search tree
Q. Which of the following data structure can’t store the non-homogeneous data elements?
a. arrays
b. records
c. pointers
d. stacks
Q. 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
Q. Which data structure is used in breadth first search of a graph to hold nodes?
a. stack
b. queue
c. tree
d. array
Q. 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 qequeue
c. priority queues
d. stack