Question 1

int recFunc(int num)
{
$\quad$if (num >= 10)
$\quad$$\quad$return 10;
$\quad$else
$\quad$$\quad$return num * recFunc(num + 1);
}
-Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(8)<< endl;
A) 4
B) 8
C) 72
D) 720

Accepted Answer

D

Question 2

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

Accepted Answer

The base case is a condition that when met, stops the function from calling itself again (recursing) and returns a value or executes a specific block of code. This is necessary in order to prevent the function from entering an infinite loop. Therefore, the statement is true.

Question 3

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

Accepted Answer

False

Question 4

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

Accepted Answer

Every time a recursive function is called, a new instance of local variables and formal parameters are created, which requires memory allocation. This memory is eventually released as the recursion unwinds.

Question 5

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

Accepted Answer

The answer of In the Tower of Hanoi recursive program,if...

Question 6

int recFunc(int num)
{
$\quad$if (num >= 10)
$\quad$$\quad$return 10;
$\quad$else
$\quad$$\quad$return num * recFunc(num + 1);
}
-Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(10)<< endl;
A) 10
B) 11
C) 100
D) 110

Accepted Answer

The answer of int recFunc(int num)
{
$\quad$if (num >= 10)
$\quad$$\quad$return 10;
$\quad$else
$\quad$$\quad$return...

Question 7

-Consider the accompanying definition of a recursive function.Which of the statements represent the base case?
A) Statements in Lines 3 and 4
B) Statements in Lines 5 and 6
C) Statements in Lines 3-6
D) Statements in Lines 5-10

Accepted Answer

The answer of 
-Consider the accompanying definition of a recursive...

Question 8

The following is an example of a recursive function,where nextNum is a function such that nextNum(x)= x + 1.
int recFunc(int x)
{
return nextNum(nextNum(x));
}

Accepted Answer

This is not a recursive function because it does not call itself within its definition.

Question 9

The following is a valid recursive definition to determine the factorial of a non-negative integer.
0! = 1
1! = 1
n! = n * (n - 1)! if n > 0

Accepted Answer

The definition covers the base cases of 0! and 1!, as well as the recursive case for any n greater than 0.

Question 10

The following is an example of a recursive function.
void print(int x)
{
$\quad$if (x > 0)
$\quad${
$\quad$$\quad$cout << x << " " ;
$\quad$$\quad$print (x - 1);
$\quad$}
}

Accepted Answer

The function calls itself with a smaller value of x until x becomes zero or negative. Therefore, it meets the definition of a recursive function.

Question 11

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

Accepted Answer

When designing a recursive function, it is important to determine the base or limiting conditions that will stop the function from calling itself and create an infinite loop. Without these limiting conditions, the function could keep calling itself indefinitely and crash the program.

Question 12

int recFunc(int num)
{
$\quad$if (num >= 10)
$\quad$$\quad$return 10;
$\quad$else
$\quad$$\quad$return num * recFunc(num + 1);
}
-Tracing through ____ recursion is more tedious than tracing other recursive forms.
A) direct
B) indirect
C) tail
D) iterative

Accepted Answer

The answer of int recFunc(int num)
{
$\quad$if (num >= 10)
$\quad$$\quad$return 10;
$\quad$else
$\quad$$\quad$return...

Question 13

int foo(int n) //Line 1
{ //Line 2
if (n == 0) //Line 3
return 0; //Line 4
else //Line 5
return n + foo(n - 1); //Line 6
} //Line 7
-Consider the accompanying definition of a recursive function.Which of the statements represents the base case?
A) Statements in Lines 1-6.
B) Statements in Lines 3 and 4.
C) Statements in Lines 5 and 6.
D) Statements in Lines 3, 4, and 5.

Accepted Answer

The base case is the scenario where the function does not call itself again, and Line 3 checks for this condition. If n equals 0, the function returns 0 in Line 4, and the recursion stops. Therefore, the statements in Lines 3 and 4 represent the base case.

Question 14

A definition in which something is defined in terms of a smaller version of itself is called a(n)____ definition.
A) step-wise
B) recursive
C) member-wise
D) iterative

Accepted Answer

Recursive definitions define something in terms of a smaller version of itself, which allows for the use of the same logic and rules repeatedly to generate the desired result.

Question 15

Consider the following definition of the recursive function print. void print(int num)
{
$\quad$If (num > 0)
$\quad${
$\quad$$\quad$Cout << num << " ";
$\quad$$\quad$Print(num - 1);
$\quad$}
}
What is the output of the following statement?
Print(4);
A) 0 1 2 3 4
B) 1 2 3 4
C) 4 3 2 1
D) 4 3 2 1 0

Accepted Answer

The function print(num) recursively calls itself with num-1 until the base case of num<=0 is reached. Therefore, the output will be 4 3 2 1 since the function starts with num=4 and decreases by 1 in each recursive call until the base case is reached.

Question 16

-Consider the accompanying definition of a recursive function.Which of the statements represent the general case?
A) Statements in Lines 3-11
B) Statements in Lines 5-6
C) Statements in Lines 5-11
D) Statements in Lines 7-11

Accepted Answer

The answer of 
-Consider the accompanying definition of a recursive...

Question 17

int foo(int n) //Line 1
{ //Line 2
if (n == 0) //Line 3
return 0; //Line 4
else //Line 5
return n + foo(n - 1); //Line 6
} //Line 7
-Consider the accompanying definition of a recursive function.Which of the statements represent the general case?
A) Statements in Lines 1-6
B) Statements in Lines 3 and 4
C) Statements in Lines 4, 5, and 6
D) Statements in Lines 5 and 6

Accepted Answer

The general case is the condition when the input parameter is not equal to 0. This is represented by statements in Lines 5 and 6 which return the result of adding n to the function called recursively with the parameter n-1.

Question 18

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

Accepted Answer

A recursive algorithm can be used to find the largest element in an array by comparing each element with the largest element found so far in the recursive function. The base case can be when the array has only one element, in which case that element itself is the largest.

Question 19

Infinite recursions execute forever on a computer.

Accepted Answer

The answer of Infinite recursions execute forever on a computer....

Question 20

The ____ case is the case for which the solution is obtained directly.
A) general
B) base
C) direct
D) tail

Accepted Answer

The base case is the simplest instance of a problem, which can be solved directly without further recursion or iteration.

Quiz 15: Recursion

int recFunc(int num) { $\quad$ if (num >= 10) $\quad$ $\quad$ return 10; $\quad$ else $\quad$ $\quad$ return num * recFunc(num + 1) ; } -Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(8) << endl;

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

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

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

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

int recFunc(int num) { $\quad$ if (num >= 10) $\quad$ $\quad$ return 10; $\quad$ else $\quad$ $\quad$ return num * recFunc(num + 1) ; } -Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(10) << endl;

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

The following is an example of a recursive function,where nextNum is a function such that nextNum(x)= x + 1. int recFunc(int x) { return nextNum(nextNum(x)); }

The following is a valid recursive definition to determine the factorial of a non-negative integer. 0! = 1 1! = 1 n! = n * (n - 1)! if n > 0

The following is an example of a recursive function. void print(int x) { $\quad$ if (x > 0) $\quad$ { $\quad$ $\quad$ cout << x << " " ; $\quad$ $\quad$ print (x - 1); $\quad$ } }

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

int recFunc(int num) { $\quad$ if (num >= 10) $\quad$ $\quad$ return 10; $\quad$ else $\quad$ $\quad$ return num * recFunc(num + 1) ; } -Tracing through ____ recursion is more tedious than tracing other recursive forms.

int foo(int n) //Line 1 { //Line 2 if (n == 0) //Line 3 return 0; //Line 4 else //Line 5 return n + foo(n - 1) ; //Line 6 } //Line 7 -Consider the accompanying definition of a recursive function.Which of the statements represents the base case?

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

Consider the following definition of the recursive function print. void print(int num) { $\quad$ If (num > 0) $\quad$ { $\quad$ $\quad$ Cout << num << " "; $\quad$ $\quad$ Print(num - 1) ; $\quad$ } } What is the output of the following statement? Print(4) ;

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

int foo(int n) //Line 1 { //Line 2 if (n == 0) //Line 3 return 0; //Line 4 else //Line 5 return n + foo(n - 1) ; //Line 6 } //Line 7 -Consider the accompanying definition of a recursive function.Which of the statements represent the general case?

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

Infinite recursions execute forever on a computer.

The ____ case is the case for which the solution is obtained directly.

Quiz 15: Recursion

int recFunc(int num) { \quad if (num >= 10) \quad\quad return 10; \quad else \quad\quad return num * recFunc(num + 1) ; } -Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(8) << endl;

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

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

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

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

int recFunc(int num) { \quad if (num >= 10) \quad\quad return 10; \quad else \quad\quad return num * recFunc(num + 1) ; } -Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(10) << endl;

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

The following is an example of a recursive function,where nextNum is a function such that nextNum(x)= x + 1. int recFunc(int x) { return nextNum(nextNum(x)); }

The following is a valid recursive definition to determine the factorial of a non-negative integer. 0! = 1 1! = 1 n! = n * (n - 1)! if n > 0

The following is an example of a recursive function. void print(int x) { \quad if (x > 0) \quad { \quad\quad cout << x << " " ; \quad\quad print (x - 1); \quad } }

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

int recFunc(int num) { \quad if (num >= 10) \quad\quad return 10; \quad else \quad\quad return num * recFunc(num + 1) ; } -Tracing through ____ recursion is more tedious than tracing other recursive forms.

int foo(int n) //Line 1 { //Line 2 if (n == 0) //Line 3 return 0; //Line 4 else //Line 5 return n + foo(n - 1) ; //Line 6 } //Line 7 -Consider the accompanying definition of a recursive function.Which of the statements represents the base case?

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

Consider the following definition of the recursive function print. void print(int num) { \quad If (num > 0) \quad { \quad\quad Cout << num << " "; \quad\quad Print(num - 1) ; \quad } } What is the output of the following statement? Print(4) ;

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

int foo(int n) //Line 1 { //Line 2 if (n == 0) //Line 3 return 0; //Line 4 else //Line 5 return n + foo(n - 1) ; //Line 6 } //Line 7 -Consider the accompanying definition of a recursive function.Which of the statements represent the general case?

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

Infinite recursions execute forever on a computer.

The ____ case is the case for which the solution is obtained directly.

int recFunc(int num) { $\quad$ if (num >= 10) $\quad$ $\quad$ return 10; $\quad$ else $\quad$ $\quad$ return num * recFunc(num + 1) ; } -Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(8) << endl;

int recFunc(int num) { $\quad$ if (num >= 10) $\quad$ $\quad$ return 10; $\quad$ else $\quad$ $\quad$ return num * recFunc(num + 1) ; } -Consider the accompanying definition of a recursive function.What is the output of the following statement? cout << recFunc(10) << endl;

The following is an example of a recursive function. void print(int x) { $\quad$ if (x > 0) $\quad$ { $\quad$ $\quad$ cout << x << " " ; $\quad$ $\quad$ print (x - 1); $\quad$ } }

int recFunc(int num) { $\quad$ if (num >= 10) $\quad$ $\quad$ return 10; $\quad$ else $\quad$ $\quad$ return num * recFunc(num + 1) ; } -Tracing through ____ recursion is more tedious than tracing other recursive forms.

Consider the following definition of the recursive function print. void print(int num) { $\quad$ If (num > 0) $\quad$ { $\quad$ $\quad$ Cout << num << " "; $\quad$ $\quad$ Print(num - 1) ; $\quad$ } } What is the output of the following statement? Print(4) ;