Data Structures 300 Unique MCQs

Heap Sort is a comparison sort that repeatedly removes an extreme element from a heap.
This description distinguishes it from the other choices.

Heap Sort is commonly used for in-place sorting with O(n log n) worst-case time.
Its design supports this task efficiently or naturally.

The defining property is that it is generally not stable.
The other statements describe different structures or concepts.

Heap Sort fits because it supports in-place sorting with O(n log n) worst-case time and it is generally not stable.
Both clues point to this choice.

Counting Sort is a non-comparison sort that counts occurrences of bounded integer keys.
This description distinguishes it from the other choices.

Counting Sort is commonly used for sorting integers from a small known range.
Its design supports this task efficiently or naturally.

The defining property is that its running time depends on both item count and key range.
The other statements describe different structures or concepts.

Counting Sort fits because it supports sorting integers from a small known range and its running time depends on both item count and key range.
Both clues point to this choice.

Quick Sort is a divide-and-conquer sort that partitions around a pivot.
This description distinguishes it from the other choices.

Quick Sort is commonly used for fast general-purpose in-memory sorting.
Its design supports this task efficiently or naturally.

The defining property is that poor pivot choices can produce quadratic time.
The other statements describe different structures or concepts.

Quick Sort fits because it supports fast general-purpose in-memory sorting and poor pivot choices can produce quadratic time.
Both clues point to this choice.