1. Selection sort starts at the beginning of the list and compares pairs of data items as it moves down to the end.

A. True

B. False

2. Bubble sort is ____.

A. O(n2)

B. O(log2n)

C. O(n)

D. O(1)

3. In a ____ complexity algorithm, when the problem doubles in size, the amount of work only increases by 1.

A. quadratic

B. polynomial

C. logarithmic

D. constant

4. The performance of some algorithms depends on the placement of the data that are processed.

A. True

B. False

5. One way to measure the time cost of an algorithm is to use ____ to obtain an actual run time.

A. an escrow

B. a timer

C. the computers clock

D. a time server

6. One notation that computer scientists use to express the efficiency or computational complexity of an algorithm is called big-____ notation.

A. O

B. P

C. C

D. G

7. In asymptotic analysis, the value of a polynomial asymptotically approaches or approximates the value of its largest term as n becomes very large.

A. True

B. False

8. List indexing is a good example of a ____-time algorithm.

A. quadratic

B. linear

C. logarithmic

D. constant

9. When you count instructions to estimate the efficiency of an algorithm, you count the instructions in the executable machine language program.

A. True

B. False

10. Logarithmic complexity is better than constant but worse than linear complexity.

A. True

B. False