Computer Science Multiple Choice Review

The true/false condition is called the ____ condition.

• infinite

• continuation

• control

• iteration

____ schemes compress data in a way that does not guarantee that all of the information in the original data can be fully and completely recreated.

• Randomized compression

• Decompression

• Lossy compression

• Repeat sampling

To create a loop that executes exactly b times, we create a ____.

• control object

• counter

• counting method

• variable

The ____ search algorithm is more efficient than the ____ search algorithm but it works only when the search list is already sorted.

• selection, binary

• binary, selection

• sequential, binary

• binary, sequential

In 1946, John Von Neumann proposed a radically different computer design based on a model called the ____ computer.

• stored program

• external program

• programmable function

• memory unit

The ____ sort algorithm performs the task of sorting a list by growing a sorted subsection of the list from the back to the front.

• selection

• sequential

• shuffle-left

• binary

Together, conditional and iterative operations are called ____ operations.

• sequential

• control

• hierarchical

• dynamic

In 1614, John Napier invented ____ as a way to simplify difficult mathematical computations.

• algorithms

• logarithms

• electronic computers

• mechanical computers

An algorithm can fall into an infinite loop when ____.

• the input operations are missing

• the algorithm uses more than one loop

• the output operations are missing

• the continuation condition of the loop never becomes false

In a base-2 and a base-10 system, the value of a digit depends on its ____ within a number.

• baseline

• specific position

• algorithm

• valence