Exam 2: Algorithm Discovery and Design

____ operations send results from the computing agent to the outside world.

____________________ is sometimes called a programming language without any details.

The process of finding a solution to a given problem is called ____________________ discovery.

An unstructured, "free-flowing" writing style should be used for writing algorithms.

The use of high-level instructions during the design process is an example of abstraction._________________________

Input and output enable the computing agent to communicate with the outside world.

The three basic sequential operations are called addition, multiplication, and exponentiation.

A(n) ____ is a collection of useful, prewritten algorithms.

During the initial phases of design, we should be thinking and writing at a highly ____________________ level.

Once an algorithm has been developed, it may itself be used in the construction of other algorithms.

Viewing an operation at a high level of abstraction and fleshing out the details of its implementation at a later time is known as ____ design.

Together, conditional and iterative operations are called ____ operations.

In a(n) ____________________ loop, it is possible for the loop body to never be executed.

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

The process of searching for a special pattern of symbols within a larger collection of information is called object matching._________________________

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

A(n) control algorithm executes its instructions in a straight line from top to bottom and then stops._________________________

An algorithm can fall into an infinite loop when ____.

A ____ is the repetition of a block of instructions.

Under what circumstances would the body of a pretest loop never be executed?