Exam 15: Recursion

If every recursive call results in another recursive call, then the recursive function (algorithm) is said to have ____ recursion.

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

The recursive algorithm must have one or more base cases, and the general solution must eventually be reduced to a(n) ____________________.

Consider the following recursive definition, where n is a positive integer. The value of F(3) is ____________________.

Consider the following definition of the recursive function print. What is the output of the following statement? Print(4);

If you execute an infinite recursive function on a computer, the function executes until the system runs out of ____________________.

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

Tracing through ____ recursion is more tedious than tracing other recursive forms.

In the Tower of Hanoi problem, if needle 1 contains three disks, then the number of moves required to move all three disks from needle 1 to needle 3 is ____________________.

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

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

A function is called ____ if it calls itself.

With recursion, the base case must eventually be reduced to a general case.

Infinite recursions execute forever on a computer.

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

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

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

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

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

Which of the following rules should you follow to solve the Tower of Hanoi problem?