Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. ___________are used to facilitate the processing of information in an array.
a. Pointers.
b. Memory location.
c. Records.
d. Variables.
Q. The comparison tree is also called as________.
a. decision tree.
b. binary tree.
c. sequential tree.
d. b+ tree.
Q. A linked list whose last node points back to the list node instead of containing the null pointer________.
a. circular list.
b. linked list.
c. circular doubly linked list.
d. doubly linked list.
Q. __________________ is a header list where the last node contains the null pointer.
a. Circular Header linked list
b. Grounded Header Linked list
c. Linked list
d. Linear Array
Q. Which of the following case does not exist in complexity theory
a. Best case
b. Worst case
c. Average case
d. Null case
Q. The _________ for a linked list is a pointer variable that locates the beginning of the list.
a. anchor.
b. base.
c. footer.
d. header.
Q. The time factor when determining the efficiency of algorithm is measured by____________.
a. counting microseconds.
b. counting the number of key operations.
c. counting the number of statements.
d. counting the kilobytes of algorithm.
Q. The space factor when determining the efficiency of algorithm is measured by___________.
a. counting the maximum memory needed by the algorithm.
b. counting the minimum memory needed by the algorithm.
c. counting the average memory needed by the algorithm.
d. counting the maximum disk space needed by the algorithm.
Q. The Worst case occur in linear search algorithm when_____________.
a. item is somewhere in the middle of the array.
b. item is not in the array at all.
c. item is the last element in the array.
d. item is the last element in the array or is not there at all.
Q. The complexity of linear search algorithm is____________.
a. O(log n).
b. O(n).
c. O(n2).
d. O(n log n).
Q. The time required in best case for search operation in binary tree is ____________.
a. O(n).
b. O(2n).
c. O(log n).
d. O( log 2n).
Q. Which of the following way follows in Post order traversal?
a. Root -> Left sub tree -> Right sub tree.
b. Root -> Right sub tree -> Left sub tree.
c. Left sub tree -> Root -> Right sub tree.
d. Left sub tree -> Right sub tree -> Root.
Q. A _________is a linked list which always contains a special node called the header node, at the beginningof the list.
a. Doubly Linked List.
b. Circular List.
c. Header Linked List.
d. None.
Q. _______________is a header list where the last node points back to the header node.
a. Doubly header List.
b. Singly header List.
c. Grounder Header List.
d. Circular Header List.
Q. The advantage of a two-way list and a circular header list is combined into a ________.
a. two-way circular header list.
b. two-way circular list.
c. two-way header circular list.
d. None.