MCQ Collection
Data Structures 300 Unique MCQs
Practice Data Structures 300 Unique questions with answers and explanations.
Choose an option to check your answer.
A.
the probe sequence depends on two hash functions
B.
it can suffer from primary clustering
C.
it exists only for directed acyclic graphs
D.
an edge from u to v need not imply an edge from v to u
Show Answer
Correct Answer: C. it exists only for directed acyclic graphs
Explanation:
The defining property is that it exists only for directed acyclic graphs.
Choose an option to check your answer.
A.
Amortized Analysis
B.
Radix Sort
C.
Open Addressing
D.
Topological Sort
Show Answer
Correct Answer: D. Topological Sort
Explanation:
Topological Sort fits because it supports scheduling tasks with dependencies and it exists only for directed acyclic graphs.
Choose an option to check your answer.
A.
Disjoint Set Union
B.
Directed Graph
C.
Selection Sort
D.
Priority Queue
Show Answer
Correct Answer: A. Disjoint Set Union
Explanation:
Disjoint Set Union is a structure that maintains a partition of elements into disjoint sets.
Choose an option to check your answer.
A.
Breadth-First Search
B.
Bloom Filter
C.
Bucket Sort
D.
Suffix Array
Show Answer
Correct Answer: A. Breadth-First Search
Explanation:
Breadth-First Search is a graph traversal that explores vertices level by level.
Choose an option to check your answer.
A.
simple hash-table implementations
B.
shortest paths in unweighted graphs
C.
workloads with strong locality of reference
D.
fast random access when the index is known
Show Answer
Correct Answer: B. shortest paths in unweighted graphs
Explanation:
Breadth-First Search is commonly used for shortest paths in unweighted graphs.
Choose an option to check your answer.
A.
every level is completely filled
B.
it may examine every element
C.
it typically uses a queue
D.
collisions must be handled when keys map to the same position
Show Answer
Correct Answer: C. it typically uses a queue
Explanation:
The defining property is that it typically uses a queue.
Choose an option to check your answer.
A.
Radix Tree
B.
Amortized Analysis
C.
Quick Sort
D.
Breadth-First Search
Show Answer
Correct Answer: D. Breadth-First Search
Explanation:
Breadth-First Search fits because it supports shortest paths in unweighted graphs and it typically uses a queue.
Choose an option to check your answer.
A.
Depth-First Search
B.
Queue
C.
Memory Pool
D.
Linear Probing
Show Answer
Correct Answer: A. Depth-First Search
Explanation:
Depth-First Search is a traversal that explores as deeply as possible before backtracking.
Choose an option to check your answer.
A.
Binary Search
B.
Reference Counting
C.
Min-Heap
D.
Adjacency List
Show Answer
Correct Answer: D. Adjacency List
Explanation:
Adjacency List fits because it supports sparse graphs and its space usage is proportional to vertices plus edges.
Choose an option to check your answer.
A.
Adjacency Matrix
B.
Selection Sort
C.
Fibonacci Heap
D.
In-Place Algorithm
Show Answer
Correct Answer: A. Adjacency Matrix
Explanation:
Adjacency Matrix is a square matrix indicating which vertex pairs are connected.
Choose an option to check your answer.
A.
in-place sorting with O(n log n) worst-case time
B.
dense graphs and constant-time edge-existence tests
C.
prefix search and autocomplete
D.
representing hierarchical binary relationships
Show Answer
Correct Answer: B. dense graphs and constant-time edge-existence tests
Explanation:
Adjacency Matrix is commonly used for dense graphs and constant-time edge-existence tests.
Choose an option to check your answer.
A.
each edge connects two vertices bidirectionally
B.
it avoids allocating an auxiliary structure proportional to input size
C.
its space usage is quadratic in the number of vertices
D.
its main operations are find and union
Show Answer
Correct Answer: C. its space usage is quadratic in the number of vertices
Explanation:
The defining property is that its space usage is quadratic in the number of vertices.
