Q. In ……………, search start at the beginning of the list and check every element in the list.
✅ Correct Answer: (A)
linear search
Data Structure (DS) MCQs | Page - 3
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 graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
✅ Correct Answer: (B)
bipartite
Q. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
✅ Correct Answer: (B)
0 and -1
Q. In a circular queue the value of r will be ..
✅ Correct Answer: (C)
r=(r+1)% queue_size
Q. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
✅ Correct Answer: (B)
linked lists
Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5
✅ Correct Answer: (C)
4
Q. ………… is not the operation that can be performed on queue.
✅ Correct Answer: (D)
traversal
Q. There is an extra element at the head of the list called a ……….
✅ Correct Answer: (B)
sentinel
Q. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
✅ Correct Answer: (A)
vertices, edges
Jump to