Data Structures MCQs

Breadth-First Search is a graph traversal that explores vertices level by level.
This description distinguishes it from the other choices.

Breadth-First Search is commonly used for shortest paths in unweighted graphs.
Its design supports this task efficiently or naturally.

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

Breadth-First Search fits because it supports shortest paths in unweighted graphs and it typically uses a queue.
Both clues point to this choice.

Depth-First Search is a traversal that explores as deeply as possible before backtracking.
This description distinguishes it from the other choices.

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.

Adjacency List fits because it supports sparse graphs and its space usage is proportional to vertices plus edges.
Both clues point to this choice.

Adjacency List is a graph representation storing the neighbors of each vertex.
This description distinguishes it from the other choices.

Adjacency List is commonly used for sparse graphs.
Its design supports this task efficiently or naturally.

The defining property is that its space usage is proportional to vertices plus edges.
The other statements describe different structures or concepts.