Top MCQs on Data Structures in DSA with Answers

Question 1

Which data structure is used for balancing of symbols?

• Stack
• Queue
• Tree
• Graph

Question 2

Which data structure is used in redo-undo feature?

• Stack
• Queue
• Tree
• Graph

Question 3

Which data structure is most efficient to find the top 10 largest items out of 1 million items stored in file?

• Min heap
• Max heap
• BST
• Sorted array

Question 4

The best data structure to check whether an arithmetic expression has balanced parentheses is a (GATE CS 2004)

• queue
• stack
• tree
• list

Question 5

A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elements in the set.

   o	Deletion of the smallest element 
   o	Insertion of an element if it is not already present in the set

Which of the following data structures can be used for this purpose?

• A heap can be used but not a balanced binary search tree

• A balanced binary search tree can be used but not a heap

• Both balanced binary search tree and heap can be used

• Neither balanced binary search tree nor heap can be used

Question 6

The most appropriate matching for the following pairs

X: depth first search            1: heap
Y: breadth-first search          2: queue
Z: sorting                       3: stack

is (GATE CS 2000):

• X—1 Y—2 Z-3
• X—3 Y—1 Z-2
• X—3 Y—2 Z-1
• X—2 Y—3 Z-1

Question 7

Which among the following data structures is best suited for storing very large numbers (numbers that cannot be stored in long long int). Following are the operations needed for these large numbers.

• Array
• Linked List
• Binary Tree
• Hash

Question 8

Which data structure is best suited for converting recursive implementation to iterative implementation of an algorithm?

• Queue
• Stack
• Tree
• Graph

Question 9

Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited for synchronization?

• Circular Linked List
• Queue
• Stack
• Priority Queue

Question 10

Which of the following data structures is best suited for efficient implementation of priority queue?

• Array
• Linked List
• Heap
• Stack