Top 150+ Solved Data Structure (DS) MCQ Questions Answer
Q. To represent hierarchical relationship between elements, Which data structure is suitable?
a. dequeue
b. priority
c. tree
d. graph
Q. 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
Q. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
a. depth first
b. breadth first
c. with first
d. depth limited
Q. The number of comparisons done by sequential search is ………………
a. (n/2)+1
b. (n+1)/2
c. (n-1)/2
d. (n+2)/2
Q. In ……………, search start at the beginning of the list and check every element in the list.
a. linear search
b. binary search
c. hash search
d. binary tree search
Q. Which of the following is not the internal sort?
a. insertion sort
b. bubble sort
c. merge sort
d. heap sort
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.
a. partite
b. bipartite
c. rooted
d. bisects
Q. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
a. 0 and 1
b. 0 and -1
c. -1 and 0
d. 1 and 0
Q. In a circular queue the value of r will be ..
a. r=r+1
b. r=(r+1)% [queue_size – 1]
c. r=(r+1)% queue_size
d. 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.
a. lists
b. linked lists
c. trees
d. queues
Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5
a. 5
b. 6
c. 4
d. none
Q. ………… is not the operation that can be performed on queue.
a. insertion
b. deletion
c. retrieval
d. traversal
Q. There is an extra element at the head of the list called a ……….
a. antinel
b. sentinel
c. list header
d. list head
Q. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
a. vertices, edges
b. edges, vertices
c. vertices, paths
d. graph node, edges