Data Structures 300 Unique MCQs

The defining property is that each bucket commonly references a list or another secondary structure.
The other statements describe different structures or concepts.

Separate Chaining fits because it supports hash tables with flexible load factors and each bucket commonly references a list or another secondary structure.
Both clues point to this choice.

Open Addressing is a collision-resolution method that stores all entries directly in the table array.
This description distinguishes it from the other choices.

Fibonacci Heap fits because it supports algorithms with many decrease-key operations and it provides excellent amortized decrease-key performance.
Both clues point to this choice.

Hash Table is a structure that maps keys to array positions using a hash function.
This description distinguishes it from the other choices.

Hash Table is commonly used for fast average-case dictionary operations.
Its design supports this task efficiently or naturally.

The defining property is that collisions must be handled when keys map to the same position.
The other statements describe different structures or concepts.

Hash Table fits because it supports fast average-case dictionary operations and collisions must be handled when keys map to the same position.
Both clues point to this choice.

Separate Chaining is a collision-resolution method storing multiple entries in each hash bucket.
This description distinguishes it from the other choices.

Fibonacci Heap is commonly used for algorithms with many decrease-key operations.
Its design supports this task efficiently or naturally.

The defining property is that it provides excellent amortized decrease-key performance.
The other statements describe different structures or concepts.

Max-Heap is commonly used for repeatedly retrieving the largest element.
Its design supports this task efficiently or naturally.