AP Review Units 6 & 10

Which of the following statements is TRUE of algorithms?

• Algorithms may have an infinite set of instructions.

• Algorithms must be expressed using a programming language.

• Every algorithm can be constructed using combinations of sequencing, selection, and iteration.

A(n) ___ is a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.

• algorithm

• problem

• binary search

• linear search

A(n) ___ is a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

• algorithm

• problem

• binary search

• linear search

A(n) ___ is doing some steps over and over.

• iteration

• selection

• sequencing

• efficiency

Deciding which steps to do next is referred to as ___.

• iteration

• selection

• sequencing

• efficiency

Putting steps in an order is referred to as ___.

• iteration

• selection

• sequencing

• efficiency

The ___ of an algorithm is a measure of how many steps are needed to complete an algorithm.

• iteration

• selection

• sequencing

• efficiency

A(n) ___ provides a "good enough" solution to a problem when an actual solution is impractical or impossible.

• heuristic

• undecidable problem

• unreasonable time

• reasonable time

A(n) ___ is a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer.

• heuristic

• undecidable problem

• unreasonable time

• reasonable time

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in a(n) ___.

• heuristic

• undecidable problem

• unreasonable time

• reasonable time