Data Structures 300 Unique MCQs

Adjacency Matrix fits because it supports dense graphs and constant-time edge-existence tests and its space usage is quadratic in the number of vertices.
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.

Undirected Graph is a graph whose edges have no direction.
This description distinguishes it from the other choices.

Undirected Graph is commonly used for modeling symmetric relationships.
Its design supports this task efficiently or naturally.

The defining property is that each edge connects two vertices bidirectionally.
The other statements describe different structures or concepts.

Undirected Graph fits because it supports modeling symmetric relationships and each edge connects two vertices bidirectionally.
Both clues point to this choice.

Weighted Graph is a graph whose edges or vertices carry numeric costs or values.
This description distinguishes it from the other choices.

Weighted Graph is commonly used for shortest-path and network optimization problems.
Its design supports this task efficiently or naturally.

The defining property is that path quality can depend on the sum of weights.
The other statements describe different structures or concepts.

Weighted Graph fits because it supports shortest-path and network optimization problems and path quality can depend on the sum of weights.
Both clues point to this choice.