Exam 2: Algorithm Discovery and Design

Java and C++ are examples of pseudocode languages.

Briefly describe what pseudocode is and is not.

The selection of an algorithm to solve a problem is greatly influenced by the way the input ____ for that problem are organized.

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.

____ is an example of a natural language.

What is the problem with using high-level programming languages to represent algorithms?

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

A ____ is the repetition of a block of instructions.

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

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

A pattern-matching algorithm may be used to implement a _______ function in a word processor.

With a natural language, different readers can interpret the same sentence in totally different ways.

A purely ____ algorithm is sometimes termed a straight-line algorithm.

A(n)____ is an algorithmic operation that carries out a single numeric computation and stores the result.

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

An unstructured, "natural language" writing style should never be used for writing algorithms.

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

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

"Print the value of product " is an example of a(n)____ operation.

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