Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. Which of the following data structures are indexed structures?
a. Linear arrays.
b. Linked lists.
c. Arrays.
d. First address.
Q. The efficiency of a BFS algorithm is dependent on _______.
a. Algorithm.
b. Tree.
c. Problem.
d. Graph.
Q. The average number of key comparisons done in a successful sequential search in a list of length n is____________.
a. log n.
b. n-1/2.
c. n/2.
d. n+1/2.
Q. Divide and conquer is an important algorithm design paradigm based on _______.
a. multi-branched recursion.
b. single-branched recursion.
c. two-way recursion.
d. None.
Q. The correctness of a divide and conquer algorithm is usually proved by _________.
a. mathematical theorem.
b. de-Morgan `s law.
c. mathematical induction.
d. none.
Q. The ____________ is used in an elegant sorting algorithm.
a. Heap sort.
b. Quick sort.
c. Merge sort.
d. Radix sort.
Q. ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.
a. Travelling Salesman tour.
b. Eulerian tour.
c. Hamiltonian tour.
d. None.
Q. ____________ data structure is used to implement Depth First search.
a. Array.
b. Linked list.
c. Queue.
d. Stack.
Q. The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
a. log2N
b. n-1
c. n
d. None of the above
Q. Each entry in a linked list is a called a_______________.
a. Link.
b. Node.
c. Data Structure.
d. Avail.
Q. Which of the following is two way lists?
a. Grounded header list.
b. Circular header list.
c. Linked list with header and trailer nodes.
d. List traversed in two directions.
Q. In a linked list the _________field contains the address of next element in the list.
a. Link field.
b. Next element field.
c. Start field.
d. Info field .
Q. A list that has no nodes is called________.
a. End list.
b. Zero list.
c. Null list.
d. Sentinel list.
Q. The special list which consists of unused memory space is called __________.
a. Free space.
b. Empty space.
c. Available space.
d. Free storage list.
Q. The efficient searching algorithm for algorithm for a sorted array is _________.
a. Binary search.
b. Linear search.
c. Indexed search.
d. Repeated search.