Q. Which if the following is/are the levels of implementation of data structure
✅ Correct Answer: (D)
all of the above
Data Structure (DS) MCQs | Page - 1
Dear candidates you will find MCQ questions of Data Structure (DS) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Q. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
✅ Correct Answer: (A)
avl tree
Q. …………… is not the component of data structure.
✅ Correct Answer: (D)
none of above
Q. Which of the following is not the part of ADT description?
✅ Correct Answer: (D)
none of the above
Q. ……………. Is a pile in which items are added at one end and removed from the other.
✅ Correct Answer: (B)
queue
Q. ………… is very useful in situation when data have to stored and then retrieved in reverse order.
✅ Correct Answer: (A)
stack
Q. Which data structure allows deleting data elements from and inserting at rear?
✅ Correct Answer: (B)
queues
Q. Which of the following data structure can’t store the non-homogeneous data elements?
✅ Correct Answer: (A)
arrays
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.
✅ Correct Answer: (A)
queue linked list
Jump to