Data Structures 300 Unique MCQs

Path Compression is commonly used for accelerating repeated disjoint-set queries.
Its design supports this task efficiently or naturally.

The defining property is that it flattens the parent structure over time.
The other statements describe different structures or concepts.

Path Compression fits because it supports accelerating repeated disjoint-set queries and it flattens the parent structure over time.
Both clues point to this choice.

Union by Rank is a disjoint-set optimization that attaches the shallower tree under the deeper tree.
This description distinguishes it from the other choices.

Union by Rank is commonly used for keeping union-find trees short.
Its design supports this task efficiently or naturally.

Disjoint Set Union is commonly used for connectivity queries and Kruskal's algorithm.
Its design supports this task efficiently or naturally.

The defining property is that its main operations are find and union.
The other statements describe different structures or concepts.

Depth-First Search is commonly used for cycle detection, topological reasoning, and connectivity.
Its design supports this task efficiently or naturally.

The defining property is that it typically uses recursion or a stack.
The other statements describe different structures or concepts.

Depth-First Search fits because it supports cycle detection, topological reasoning, and connectivity and it typically uses recursion or a stack.
Both clues point to this choice.

Topological Sort is a linear ordering of vertices that respects all directed precedence edges.
This description distinguishes it from the other choices.

Topological Sort is commonly used for scheduling tasks with dependencies.
Its design supports this task efficiently or naturally.