Data Structures and Algorithms Practice MCQs

Question 1

Which data structure does not support a traverse operation?

Accepted Answer

D. Stack

Answer

Linked list

Answer

Queue

Answer

Array

Answer

Stack

Question 2

Which data structure is used for implementing DFS in a graph?

Accepted Answer

A. Stack (or recursion)

Answer

Stack (or recursion)

Answer

Linked list

Answer

Queue

Answer

Heap

Question 3

A structure that contains at least one member pointing to the same structure type is called:

Accepted Answer

C. Self-referential structure

Answer

Recursive structure

Answer

Inner structure

Answer

Self-referential structure

Answer

Nested structure

Question 4

Which of the following is true about arrays vs linked lists?

Accepted Answer

D. Arrays have O(1) random access, lists don't

Answer

Lists have O(1) random access, arrays don't

Answer

Lists support no dynamic insertion

Answer

Arrays and lists behave the same

Answer

Arrays have O(1) random access, lists don't

Question 5

Binary search requires the data to be:

Accepted Answer

B. Sorted

Answer

Random

Answer

Sorted

Answer

Dense

Answer

Hashed

Question 6

Which of these is a linear data structure?

Accepted Answer

D. Queue

Answer

Graph

Answer

Tree

Answer

Heap

Answer

Queue

Question 7

Which data structure is used for implementing BFS in a graph?

Accepted Answer

C. Queue

Answer

Array

Answer

Stack

Answer

Queue

Answer

Heap

Question 8

Which data structure is used to implement a priority queue efficiently?

Accepted Answer

C. Binary heap

Answer

Stack

Answer

Linked list

Answer

Binary heap

Answer

Array

Question 9

Best data structure to implement an LRU cache with O(1) operations:

Accepted Answer

A. Hash map + doubly linked list

Answer

Hash map + doubly linked list

Answer

BST

Answer

Single linked list

Answer

Array

Question 10

Which data structure is best for implementing a graph of millions of nodes and few edges per node?

Accepted Answer

B. Adjacency list

Answer

Tree

Answer

Adjacency list

Answer

Adjacency matrix

Answer

Edge list only

Question 11

Which of these is an example of a non-linear data structure?

Accepted Answer

D. Tree

Answer

Queue

Answer

Array

Answer

Stack

Answer

Tree

Question 12

Which of these is the best data structure to check balanced parentheses?

Accepted Answer

B. Stack

Answer

Heap

Answer

Stack

Answer

Queue

Answer

Linked List

Question 13

When pushing to a full (static) stack occurs, it is called:

Accepted Answer

A. Overflow

Answer

Overflow

Answer

Segmentation

Answer

Collision

Answer

Underflow

Question 14

In a binary heap, children of node at index i (0-based array) are at:

Accepted Answer

A. 2i+1, 2i+2

Answer

2i+1, 2i+2

Answer

i-1, i+1

Answer

2i, 2i+1

Answer

i/2

Question 15

Which graph data structure consumes O(V²) memory?

Accepted Answer

C. Adjacency matrix

Answer

Adjacency list

Answer

Incidence list

Answer

Adjacency matrix

Answer

Edge list

Data Structures and Algorithms Practice MCQs

Data Structures and Algorithms Free MCQs

Which data structure does not support a traverse operation?

Which data structure is used for implementing DFS in a graph?

A structure that contains at least one member pointing to the same structure type is called:

Which of the following is true about arrays vs linked lists?

Binary search requires the data to be:

Which of these is a linear data structure?

Which data structure is used for implementing BFS in a graph?

Which data structure is used to implement a priority queue efficiently?

Best data structure to implement an LRU cache with O(1) operations:

Which data structure is best for implementing a graph of millions of nodes and few edges per node?

Which of these is an example of a non-linear data structure?

Which of these is the best data structure to check balanced parentheses?

When pushing to a full (static) stack occurs, it is called:

In a binary heap, children of node at index i (0-based array) are at:

Which graph data structure consumes O(V²) memory?

Which traversal is NOT possible using a normal (non-threaded) BST without recursion/auxiliary structure?

Which data structure is used for undo operations in editors?

What is the time complexity of deleting an element from an unsorted array of n elements (preserving order not required)?

Which of these is an advanced (non-linear) DS?

Which of these data structures is suitable for implementing an event-driven simulation (events ordered by time)?

Read Data Structures and Algorithms Study Notes