Data Structures MCQs

Amortized Analysis fits because it supports explaining occasional expensive dynamic-array operations and a costly operation can be offset by many cheap operations.
Both clues point to this choice.

Big-O Notation is an asymptotic upper bound on growth rate.
This description distinguishes it from the other choices.

Big-O Notation is commonly used for describing scalability independent of machine speed.
Its design supports this task efficiently or naturally.

The defining property is that constant factors and lower-order terms are ignored asymptotically.
The other statements describe different structures or concepts.

Big-O Notation fits because it supports describing scalability independent of machine speed and constant factors and lower-order terms are ignored asymptotically.
Both clues point to this choice.

Amortized Analysis is analysis that averages operation cost over a sequence rather than using probability.
This description distinguishes it from the other choices.

Amortized Analysis is commonly used for explaining occasional expensive dynamic-array operations.
Its design supports this task efficiently or naturally.

The defining property is that a costly operation can be offset by many cheap operations.
The other statements describe different structures or concepts.

Stable Sorting is a sorting property that preserves the relative order of equal keys.
This description distinguishes it from the other choices.

Stable Sorting is commonly used for multi-key sorting.
Its design supports this task efficiently or naturally.

The defining property is that equal-key records remain in their original relative order.
The other statements describe different structures or concepts.

Stable Sorting fits because it supports multi-key sorting and equal-key records remain in their original relative order.
Both clues point to this choice.