Data Structures MCQs

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

Directed Graph is commonly used for modeling one-way relationships.
Its design supports this task efficiently or naturally.

The defining property is that an edge from u to v need not imply an edge from v to u.
The other statements describe different structures or concepts.

Double Hashing is commonly used for reducing clustering in hash tables.
Its design supports this task efficiently or naturally.

The defining property is that the probe sequence depends on two hash functions.
The other statements describe different structures or concepts.

Double Hashing fits because it supports reducing clustering in hash tables and the probe sequence depends on two hash functions.
Both clues point to this choice.

Graph is a set of vertices connected by edges.
This description distinguishes it from the other choices.

Graph is commonly used for modeling networks, routes, and relationships.
Its design supports this task efficiently or naturally.

The defining property is that edges may be directed or undirected.
The other statements describe different structures or concepts.

Graph fits because it supports modeling networks, routes, and relationships and edges may be directed or undirected.
Both clues point to this choice.

Directed Graph is a graph whose edges have orientation.
This description distinguishes it from the other choices.

Linear Probing fits because it supports simple hash-table implementations and it can suffer from primary clustering.
Both clues point to this choice.