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

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

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

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

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

Together, conditional and iterative operations are called ____ operations.

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

An algorithm can fall into an infinite loop when ____.

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

____ involves the fixing of errors that are uncovered through repeated usage with different input values.

The ____ algorithm does the same amount of work no matter how the numbers are initially arranged.

The ____ is the subsystem that performs such mathematical and logical operations as addition, subtraction, and comparison for equality.

____ is a circuit construction algorithm.

The popular compression technique known as ____ code sets is often used to compress text but can also be used with other forms of data.

When the registrar at your institution sorts students in a class by name, he or she is using the ____ algorithm.

The ____ of a disk is the time for the beginning of the desired sector to rotate under the read/write head.

Automation of repetitive mental tasks was part of a movement known as the ____ revolution.

The ____ machine language instructions alter the normal sequential flow of control.

A(n) ____ is a named storage location that can hold a data value.

____ is one of the most common applications of computers.

There are ____ stable states in a bistable environment.

A(n) ____ is a distinct point located on an image’s surface.

During the ____ phase, the control unit circuitry generates the necessary sequence of control signals and data transfer signals to the other units of the computer to carry out the instruction.

A(n) ____ handles the details of input/output and compensates for any speed differences between I/O devices and other parts of the computer.

In 1672, a French philosopher and mathematician designed and built one of the first mechanical calculators named the ____ that could do addition and subtraction.

In a ____, the original contents of the memory cell are unchanged.

____ is the functional unit of a computer that stores and retrieves instructions and data.

The most common format for storing color images is the ____ encoding scheme.

In ____ computer science, researchers study the logical and mathematical properties of problems and their solutions.

____ was the first programmable device.

ASCII is able to encode a total of ____ different characters.

____ statements are the “question-asking” operations of an algorithm.

In Babbage's analytical engine, a mill was used to ____.

MIMD parallel processing is also called ____.

An algorithm is essentially useless when ____.

____ operations provide the computing agent with data values from the outside world that it may then use in later instructions.

The ____ was the first fully electronic general-purpose programmable computer.

If a computer has a maximum of 2^N memory cells, then each address field in a machine language instruction must be ____ bits wide to enable us to address every cell.

To understand how computers process information, we must study computers as collections of ____ that perform tasks such as information processing, information storage, computation, and data transfer functional units.

The ____ of a disk is the time needed to position the read/write head over the correct track.

The ____ is the number of bits used to encode each sample.

A ____ is the repetition of a block of instructions.

The True Color scheme uses ____ bits.

____ is the algorithmic equivalence of style.

The worst case in binary search occurs ____.

In the sequential search algorithm, the minimum amount of work is done if the value being searched for is the ____ value in the list.

The history of mathematics begins ____ years ago.

Which of the following is NOT an extremely desirable attribute of an algorithm?

The ____ of a sound wave is a measure of its loudness.