Exam 15: Recursion

You can use a recursive algorithm to find the largest element in an array.

Suppose that function A calls function B, function B calls function C, function C calls function D, and function D calls function A.Function A is then ____________________ recursive.

-Consider the accompanying definition of a recursive function.Which of the statements represent the general case?

Infinite recursions execute forever on a computer.

-Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << puzzle(3, 7) << endl;

A recursive function in which the last statement executed is the recursive call is called a(n) ____ recursive function.

The following is an example of a recursive function.

-Consider the accompanying definition of a recursive function.Which of the statements represent the base case?

A function is called ____ if it calls itself.

-Consider the accompanying definition of the recursive function mystery.Given the declaration:int alpha[5] = {1, 4, 5, 8, 9}; what is the output of the following statement? Cout << mystery(alpha, 0, 4) << endl;

In a recursive function, the base case stops the recursion.

Consider the following definition of the recursive function mystery. What is the output of the following statement? Cout << mystery(5) << endl;

To design a recursive function, you must determine the limiting conditions.

-Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << puzzle(5, 10) << endl;

A definition in which something is defined in terms of a smaller version of itself is called a(n) ____ definition.

-Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(8) << endl;

The ____ case is the case for which the solution to an equation is obtained directly.

If a function A calls a function B and function B calls function A, then function A is ____________________ recursive.

Which of the following solutions is easier to construct for the Tower of Hanoi problem?

Which of the following solution methods would be the best choice for a mission control system?