Exam 2: Algorithm Discovery and Design

____ is an example of a natural language.

Having an infinite loop in an algorithm is an error.

Together, conditional and iterative operations are called ____ operations.

A sequential algorithm executes its instructions in a straight line from top to bottom and then stops.

____ operations allow the computing agent to receive data values from the outside world that it may then use in later instructions.

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.

Finding the maximum number in a given set is an example of a problem that computer scientists want to solve.

The technique of looking at all the items in a list, starting at the beginning of the list, one at a time, until we either find what we are looking for or come to the end of the list is called ____ search.

When writing arithmetic expressions in pseudocode, you may assume that the computing agent executing your algorithm has all the capabilities of a typical calculator.

In a posttest loop, it is possible for the loop body to never be executed.

Java and C++ are examples of pseudocode languages.

Consider this line of code: Set the value of Area to length*width "Area" is a____.

In order to implement a "find" functionality in a word processor, one would have to design a ____ algorithm.

One of the most powerful features of a computer is its ability to handle loops.

Which statement exemplifies abstraction?

Pseudocode is a special set of English language constructs modeled to look like the statements available in most programming languages.

Most computer scientists use ____ to design and represent algorithms.

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

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

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