Data Structures MCQs

Suffix Array fits because it supports substring search and text indexing and suffixes are ordered lexicographically.
Both clues point to this choice.

Suffix Tree is a compressed trie containing all suffixes of a string.
This description distinguishes it from the other choices.

Suffix Tree is commonly used for fast pattern matching.
Its design supports this task efficiently or naturally.

The defining property is that it can support pattern search in time proportional to the pattern length.
The other statements describe different structures or concepts.

Suffix Tree fits because it supports fast pattern matching and it can support pattern search in time proportional to the pattern length.
Both clues point to this choice.

Binary Search is a searching algorithm that repeatedly halves a sorted search interval.
This description distinguishes it from the other choices.

LRU Cache fits because it supports bounded caching with temporal locality and it is commonly implemented using a hash map plus a doubly linked list.
Both clues point to this choice.

Suffix Array is a sorted array of all suffix starting positions of a string.
This description distinguishes it from the other choices.

Suffix Array is commonly used for substring search and text indexing.
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.

Bloom Filter fits because it supports quickly rejecting items that are definitely absent and false positives are possible but false negatives are not under normal operation.
Both clues point to this choice.

LRU Cache is a cache policy that evicts the least recently used item.
This description distinguishes it from the other choices.