Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. The complexity of Bubble sort algorithm is _________.
a. O(n).
b. O(log n).
c. O(n2).
d. O(n log n).
Q. Inorder traversal of binary search tree will produce _______________.
a. unsorted list.
b. sorted list.
c. reverse of input.
d. none of these.
Q. Sub algorithms fall into two basic categories: function sub algorithms and ____________ sub algorithms.
a. procedure.
b. argument.
c. processor.
d. methods.
Q. Two main measures for the efficiency of an algorithm are____________.
a. Processor and memory.
b. Complexity and capacity.
c. Time and space.
d. Data and space.
Q. New data are to be inserted into a data structure, but there is no available space; this situation is usuallycalled__________.
a. Underflow.
b. Overflow.
c. Houseful.
d. Saturate
Q. Which of the following data structure is linear data structure?
a. Tree.
b. Graph.
c. Array.
d. Linked list.
Q. Which of the following is an example of dynamic programming approach?
a. Fibonacci Series
b. Tower of Hanoi
c. Dijkstra Shortest Path
d. All of the above
Q. The memory address of the first element of an array is called_________.
a. floor address.
b. foundation address.
c. first address.
d. base address.
Q. Which data structure allows deleting data elements from front and inserting at rear?
a. Stacks.
b. Queues.
c. Dequeues.
d. Binary search tree.
Q. Binary search algorithm cannot be applied to________ concept.
a. unsorted linked list.
b. sorted binary trees.
c. sorted linear array.
d. pointer array.
Q. Graph traversal is different from a tree traversal, because
a. trees are not connected.
b. graphs may have loops.
c. trees have root.
d. None is true as tree is a subset of graph.
Q. Linked lists are suitable for which of the following problems?
a. Insertion sort
b. Binary search
c. Radix sort
d. dequeue.
Q. Identify the data structure which allows deletions at both ends of the list but insertion at only oneend___________.
a. Input-restricted dequeue.
b. Output-restricted dequeue.
c. Priority queues.
d. Data structure.
Q. Which of the following data structure is non-linear type?
a. Strings.
b. Lists.
c. Stacks.
d. Hierarchical.
Q. To represent hierarchical relationship between elements, which data structure is suitable?
a. Dequeue.
b. Priority.
c. Tree.
d. Binary tree.