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.
Correct Answer: C. constant factors and lower-order terms are ignored asymptotically
Explanation:
The defining property is that constant factors and lower-order terms are ignored asymptotically.
The other statements describe different structures or concepts.
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.
Correct Answer: C. a costly operation can be offset by many cheap operations
Explanation:
The defining property is that a costly operation can be offset by many cheap operations.
The other statements describe different structures or concepts.
Correct Answer: B. explaining occasional expensive dynamic-array operations
Explanation:
Amortized Analysis is commonly used for explaining occasional expensive dynamic-array operations.
Its design supports this task efficiently or naturally.
Amortized Analysis is analysis that averages operation cost over a sequence rather than using probability.
This description distinguishes it from the other choices.
In-Place Algorithm fits because it supports memory-constrained processing and it avoids allocating an auxiliary structure proportional to input size.
Both clues point to this choice.
Correct Answer: C. it avoids allocating an auxiliary structure proportional to input size
Explanation:
The defining property is that it avoids allocating an auxiliary structure proportional to input size.
The other statements describe different structures or concepts.
In-Place Algorithm is an algorithm that uses only a small amount of extra memory beyond its input.
This description distinguishes it from the other choices.
