Exam 15: Recursion

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.

The following is a valid recursive definition to determine the factorial of a non-negative integer.

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

How many needles are used in the Tower of Hanoi problem?

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

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

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

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

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

Consider the following code. int fact(int num) { if (num == 0) return 1; else return num * fact(num - 1); } The function fact is an example of a(n) ____________________ recursive function.

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

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

____ control structures use a looping structure, such as while, for, or do...while, to repeat a set of statements.

The following is an example of a recursive function.

Every call to a recursive function requires the system to allocate memory for the local variables and formal parameters.

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

The ____________________ Fibonacci number in a sequence is the sum of the second and third Fibonacci numbers.

Which of the following function headings can be used for a recursive definition of a function to calculate the nth Fibonacci number?

Recursive algorithms are implemented using ____________________ functions.

-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;