Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

A purely ____ algorithm is also called a straight-line algorithm.

Accepted Answer

A)  sequential 
B)  conditional 
C)  iterative 
D)  control

Question 3

A ____ is the repetition of a block of instructions.

Accepted Answer

A)  cycle 
B)  nucleus 
C)  matrix 
D)  loop

Question 4

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

Accepted Answer

A)  sequential 
B)  conditional 
C)  input 
D)  output

Question 5

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

Accepted Answer

A)  primitive 
B)  binary 
C)  set 
D)  library

Question 6

The two parts of a "while" statement are known as the loop head and the loop body.

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A)  expression 
B)  variable 
C)  computation 
D)  constant

Question 8

In a pretest loop, the continuation condition is tested at the ____ through the loop.

Accepted Answer

A)  beginning of each pass 
B)  beginning of only the first pass 
C)  end of each pass 
D)  end of only the last pass

Question 9

How could an algorithm fall into an infinite loop?

Accepted Answer

A)  the input operations were missing 
B)  the algorithm uses more than one loop 
C)  the output operations were missing 
D)  the continuation condition of the loop never becomes false

Question 10

If, then, and else are examples of ____ statements.

Accepted Answer

A)  primitive 
B)  iterative 
C)  sequential 
D)  conditional

Exam 2: Algorithm Discovery and Design