Data Structures 300 Unique MCQs

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.

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.

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

Open Addressing is commonly used for cache-friendly hash tables.
Its design supports this task efficiently or naturally.

The defining property is that probing searches for another available slot.
The other statements describe different structures or concepts.

Open Addressing fits because it supports cache-friendly hash tables and probing searches for another available slot.
Both clues point to this choice.

Linear Probing is an open-addressing method that checks consecutive slots after a collision.
This description distinguishes it from the other choices.

Linear Probing is commonly used for simple hash-table implementations.
Its design supports this task efficiently or naturally.

The defining property is that it can suffer from primary clustering.
The other statements describe different structures or concepts.

Separate Chaining is commonly used for hash tables with flexible load factors.
Its design supports this task efficiently or naturally.