Question 1

Which of the following statements is NOT true about infinite recursion?

Accepted Answer

A)  In theory, infinite recursion executes forever. 
B)  In reality, infinite recursion will lead to a computer running out of memory and abnormal termination of the program. 
C)  Methods that are indirectly recursive always lead to infinite recursion. 
D)  If recursive calls never lead to a base case, infinite recursion occurs.

Question 2

The body of a recursive method contains a statement that causes the same method to execute before completing the current call.

Accepted Answer

A) True 
 B)False

Question 3

public static int func1(int m, int n)
{
If (m == n || n == 1)
Return 1;
Else
Return func1(m - 1, n - 1) + n * func1(m - 1, n);
}Given the code in the accompanying figure, which of the following method calls would result in the value 1 being returned?

Accepted Answer

A)  func1(1, 0) 
B)  func1(1, 1) 
C)  func1(1, 2) 
D)  func1(2, 0)

Question 4

public static int func1(int m, int n)
{
If (m == n || n == 1)
Return 1;
Else
Return func1(m - 1, n - 1) + n * func1(m - 1, n);
}What precondition must exist in order to prevent the code in the accompanying figure from infinite recursion?

Accepted Answer

A)  m >= 0 and n >= 0 
B)  m >= 0 and n >= 1 
C)  m >= 1 and n >= 0 
D)  m >= 1 and n >= 1

Question 5

Recursive algorithms are implemented using while loops.

Accepted Answer

A) True 
 B)False

Question 6

Every recursive definition can have zero or more base cases.

Accepted Answer

A) True 
 B)False

Question 7

____ is NOT an iterative control structure.

Accepted Answer

A)  A while loop 
B)  A for loop 
C)  Recursion 
D)  A do...while loop

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

Consider the following definition of a recursive method.public static int recFunc(int num)
{
If (num >= 10)
Return 10;
Else
Return num * recFunc(num + 1);
}What is the output of the following statement?System.out.println(recFunc(10));

Accepted Answer

A)  10 
B)  110 
C)  This statement results in infinite recursion. 
D)  None of these

Question 10

The recursive implementation of the factorial method is an example of a tail recursive method.

Accepted Answer

A) True 
 B)False

Exam 13: Recursion

Which of the following statements is NOT true about infinite recursion?

The body of a recursive method contains a statement that causes the same method to execute before completing the current call.

public static int func1(int m, int n) { If (m == n || n == 1) Return 1; Else Return func1(m - 1, n - 1) + n * func1(m - 1, n) ; }Given the code in the accompanying figure, which of the following method calls would result in the value 1 being returned?

public static int func1(int m, int n) { If (m == n || n == 1) Return 1; Else Return func1(m - 1, n - 1) + n * func1(m - 1, n) ; }What precondition must exist in order to prevent the code in the accompanying figure from infinite recursion?

Recursive algorithms are implemented using while loops.

Every recursive definition can have zero or more base cases.

____ is NOT an iterative control structure.

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

Consider the following definition of a recursive method.public static int recFunc(int num) { If (num >= 10) Return 10; Else Return num * recFunc(num + 1) ; }What is the output of the following statement?System.out.println(recFunc(10) ) ;

The recursive implementation of the factorial method is an example of a tail recursive method.