Data Structures 300 Unique MCQs

The defining property is that it is commonly implemented using a hash map plus a doubly linked list.
The other statements describe different structures or concepts.

Skip List fits because it supports ordered dictionary operations with expected logarithmic time and higher levels allow traversal to skip many nodes.
Both clues point to this choice.

Bloom Filter is a probabilistic structure for membership testing.
This description distinguishes it from the other choices.

Bloom Filter is commonly used for quickly rejecting items that are definitely absent.
Its design supports this task efficiently or naturally.

The defining property is that false positives are possible but false negatives are not under normal operation.
The other statements describe different structures or concepts.

Fenwick Tree fits because it supports prefix sums with updates and index movement is based on the least significant set bit.
Both clues point to this choice.

Sparse Table is a static range-query structure built from overlapping power-of-two intervals.
This description distinguishes it from the other choices.

Sparse Table is commonly used for fast idempotent range queries such as minimum.
Its design supports this task efficiently or naturally.

The defining property is that it does not naturally support frequent updates.
The other statements describe different structures or concepts.

Sparse Table fits because it supports fast idempotent range queries such as minimum and it does not naturally support frequent updates.
Both clues point to this choice.

Skip List is a layered linked structure with probabilistic shortcuts.
This description distinguishes it from the other choices.

Skip List is commonly used for ordered dictionary operations with expected logarithmic time.
Its design supports this task efficiently or naturally.