Computer Science Multiple Choice Review

Front

The true/false condition is called the ____ condition.

Back

continuation

Front

____ 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.

Back

Lossy compression

Front

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

Back

counter

Front

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

Back

binary, sequential

Front

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

Back

stored program

Front

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

Back

selection

Front

Together, conditional and iterative operations are called ____ operations.

Back

control

Front

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

Back

logarithms

Front

An algorithm can fall into an infinite loop when ____.

Back

the continuation condition of the loop never becomes false

Front

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

Back

specific position