All MCQs

Directed Graph fits because it supports modeling one-way relationships and an edge from u to v need not imply an edge from v to u.
Both clues point to this choice.

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.

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

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

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

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

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

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

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.

The defining property is that the probe sequence depends on two hash functions.
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.

Double Hashing is an open-addressing method that uses a second hash function as the probe step.
This description distinguishes it from the other choices.