Data Structures 300 Unique MCQs

The defining property is that it performs a linear scan to choose each next position.
The other statements describe different structures or concepts.

Selection Sort fits because it supports sorting when minimizing swaps is useful and it performs a linear scan to choose each next position.
Both clues point to this choice.

Insertion Sort is a comparison sort that inserts each new element into a sorted prefix.
This description distinguishes it from the other choices.

Linear Search fits because it supports small or unsorted collections and it may examine every element.
Both clues point to this choice.

Bubble Sort is a comparison sort that repeatedly swaps adjacent out-of-order elements.
This description distinguishes it from the other choices.

The defining property is that it compares with a middle element at each step.
The other statements describe different structures or concepts.

Binary Search fits because it supports finding an item in sorted random-access data and it compares with a middle element at each step.
Both clues point to this choice.

Linear Search is a searching algorithm that inspects elements one by one.
This description distinguishes it from the other choices.

Linear Search is commonly used for small or unsorted collections.
Its design supports this task efficiently or naturally.

The defining property is that it may examine every element.
The other statements describe different structures or concepts.

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.