Question 1

A class member function may be recursive.

Accepted Answer

A) True 
 B)False  True

Question 2

How do you ensure that your function does not have infinite recursion?

Accepted Answer

All recursive calls must lead to a stopping case.

Question 3

In a recursive function, the statements) that invoke the function again are called the ______________.

Accepted Answer

recursive calls

Question 4

If you try to solve a problem recursively, you should

Accepted Answer

A)  find all the stopping cases and the values if needed at that case 
B)  find a recursive call that will lead towards one of the stopping cases 
C)  all of the above 
D)  none of the above 
A)  find all the stopping cases and the values if needed at that case 
B)  find a recursive call that will lead towards one of the stopping cases 
C)  all of the above 
D)  none of the above

Question 5

Recursive functions always execute faster than an iterative function.

Accepted Answer

A) True 
 B)False

Question 6

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What is the value of Fib5)?

Accepted Answer

A)  8 
B)  5 
C)  2 
D)  1 
A)  8 
B)  5 
C)  2 
D)  1

Question 7

In the following function, how many recursive calls are there?
Void towerschar source, char dest, char help, int numDisks)
{
IfnumDisks<1)
{
Return;
}
Else
{
Towerssource,help,dest,numDisks-1);
Cout << "Move disk from " << source << " to " <<dest<<endl;
Towershelp,dest,source,numDisks-1);
}
}

Accepted Answer

A)  0 
B)  1 
C)  2 
D)  3 
A)  0 
B)  1 
C)  2 
D)  3

Question 8

If your program makes too many recursive function calls, your program will cause a ___________

Accepted Answer

A)  stack underflow 
B)  activation overflow 
C)  stack overflow 
D)  syntax error 
A)  stack underflow 
B)  activation overflow 
C)  stack overflow 
D)  syntax error

Question 9

To ensure that your function recurses correctly and the proper result is reached, you must ensure that

Accepted Answer

A)  all stopping cases are correct 
B)  all recursive calls lead to one of the stopping cases 
C)  for each case that involves recursion, that case returns the correct value provided all recursive calls in that case return the correct value. 
D)  all of the above 
E)  none of the above 
A)  all stopping cases are correct 
B)  all recursive calls lead to one of the stopping cases 
C)  for each case that involves recursion, that case returns the correct value provided all recursive calls in that case return the correct value. 
D)  all of the above 
E)  none of the above

Question 10

What is wrong with the following recursive function? It should print out the array backwards.
Void printint array[], int start, int size)
{
Ifstart == size)
Return;
Else
{
Printarray, start+1,size);
Cout << array[start] << endl;
}
}

Accepted Answer

A)  infinite recursion 
B)  the stopping condition is wrong 
C)  the recursive call is wrong 
D)  nothing 
A)  infinite recursion 
B)  the stopping condition is wrong 
C)  the recursive call is wrong 
D)  nothing

Question 11

What is the output of the following code fragment?
Int f1int x, int y)
{
Ifx<0 || y<0)
Return x-y;
Else
Return f1x-1,y) + f1x,y-1);
}
Int main)
{
Cout << f12,1)<<endl;
Return 0;
}

Accepted Answer

A)  0 
B)  -1 
C)  5 
D)  -5 
A)  0 
B)  -1 
C)  5 
D)  -5

Question 12

What is the output of the following code fragment?
Int f1int base, int limit)
{
Ifbase > limit)
Return -1;
Else
Ifbase == limit)
Return 1;
Else
Return base * f1base+1, limit);
}
Int main)
{
Cout << f12,4)<<endl;
Return 0;
}

Accepted Answer

A)  2 
B)  3 
C)  -1 
D)  6 
A)  2 
B)  3 
C)  -1 
D)  6

Question 13

The factorial of an integer is the product of that integer multiplied by all the positive non-zero integers less than that integer. So, 5! ! is the mathematical symbol for factorial) is 5 * 4 * 3*2*1. 4! is 4*3*2*1, so 5! could be written as 5*4!. So a recursive definition of factorial is n! is n*n-1)!, as long as n >1. 1! is 1. What is the stopping case for this function?

Accepted Answer

A)  n<1 
B)  n==0 
C)  n==1 
D)  none of the above 
A)  n<1 
B)  n==0 
C)  n==1 
D)  none of the above

Question 14

Every time a recursive function call is executed, a new __________ is put on the top of the stack.

Accepted Answer

A)  Activity frame 
B)  Activity record 
C)  program 
D)  Activation frame 
A)  Activity frame 
B)  Activity record 
C)  program 
D)  Activation frame

Question 15

What is the output of the following code fragment?
Int f1int n, int m)
{
Ifn < m)
Return 0;
Else ifn==m)
Return m+ f1n-1,m);
Else
Return n+ f1n-2,m-1);
}
Int main)
{
Cout << f11,4);
Return 0;
}

Accepted Answer

A)  0 
B)  2 
C)  4 
D)  8 
E)  infinite recursion 
A)  0 
B)  2 
C)  4 
D)  8 
E)  infinite recursion

Question 16

What is wrong with the following recursive function? It should print out the array backwards.
Void printint array[], int start, int size)
{
Ifstart < size)
Return;
Else
{
Printarray, start+1,size);
Cout << array[start] << endl;
}
}

Accepted Answer

A)  infinite recursion 
B)  the stopping condition is wrong 
C)  the recursive call is wrong 
D)  nothing 
A)  infinite recursion 
B)  the stopping condition is wrong 
C)  the recursive call is wrong 
D)  nothing

Question 17

The factorial of an integer is the product of that integer multiplied by all the positive non-zero integers less than that integer. So, 5! ! is the mathematical symbol for factorial) is 5 * 4 * 3*2*1. 4! is 4*3*2*1, so 5! could be written as 5*4!. So a recursive definition of factorial is n! is n*n-1)!, as long as n >1. 1! is 1. What is the recursive call for this function fact)?

Accepted Answer

A)  factn)*n; 
B)  factn-1)*n; 
C)  n-1)*factn) 
D)  factn-2)*n-1) 
A)  factn)*n; 
B)  factn-1)*n; 
C)  n-1)*factn) 
D)  factn-2)*n-1)

Question 18

What is the output of the following code fragment?
Int f1int n, int m)
{
Ifn < m)
Return 0;
Else ifn==m)
Return m+ f1n-1,m);
Else
Return n+ f1n-2,m-1);
}
Int main)
{
Cout << f15,4);
Return 0;
}

Accepted Answer

A)  0 
B)  2 
C)  4 
D)  8 
E)  infinite recursion 
A)  0 
B)  2 
C)  4 
D)  8 
E)  infinite recursion

Question 19

If the recursive function call does not lead towards a stopping case, you have ______________.

Accepted Answer

infinite r

Question 20

Every recursive definition may be rewritten iteratively.

Accepted Answer

A) True 
 B)False

A class member function may be recursive.

How do you ensure that your function does not have infinite recursion?

In a recursive function, the statements) that invoke the function again are called the ______________.

If you try to solve a problem recursively, you should

Recursive functions always execute faster than an iterative function.

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What is the value of Fib5)?

In the following function, how many recursive calls are there? Void towerschar source, char dest, char help, int numDisks) { IfnumDisks<1) { Return; } Else { Towerssource,help,dest,numDisks-1); Cout << "Move disk from " << source << " to " <<dest<<endl; Towershelp,dest,source,numDisks-1); } }

If your program makes too many recursive function calls, your program will cause a ___________

To ensure that your function recurses correctly and the proper result is reached, you must ensure that

What is wrong with the following recursive function? It should print out the array backwards. Void printint array[], int start, int size) { Ifstart == size) Return; Else { Printarray, start+1,size); Cout << array[start] << endl; } }

What is the output of the following code fragment? Int f1int x, int y) { Ifx<0 || y<0) Return x-y; Else Return f1x-1,y) + f1x,y-1); } Int main) { Cout << f12,1)<<endl; Return 0; }

What is the output of the following code fragment? Int f1int base, int limit) { Ifbase > limit) Return -1; Else Ifbase == limit) Return 1; Else Return base * f1base+1, limit); } Int main) { Cout << f12,4)<<endl; Return 0; }

Every time a recursive function call is executed, a new __________ is put on the top of the stack.

What is the output of the following code fragment? Int f1int n, int m) { Ifn < m) Return 0; Else ifn==m) Return m+ f1n-1,m); Else Return n+ f1n-2,m-1); } Int main) { Cout << f11,4); Return 0; }

What is wrong with the following recursive function? It should print out the array backwards. Void printint array[], int start, int size) { Ifstart < size) Return; Else { Printarray, start+1,size); Cout << array[start] << endl; } }

What is the output of the following code fragment? Int f1int n, int m) { Ifn < m) Return 0; Else ifn==m) Return m+ f1n-1,m); Else Return n+ f1n-2,m-1); } Int main) { Cout << f15,4); Return 0; }

If the recursive function call does not lead towards a stopping case, you have ______________.

Every recursive definition may be rewritten iteratively.

Introduction to Computer and C++ Programming

C++ Basics

More Flow of Control

Procedural Abstraction and Functions That Return a Value

Functions for All Sub Tasks

Io Streams As an Introduction to Objects and Classes

Arrays

Strings and Vectors

Pointers and Dynamic Arrays

Defining Classes

Friends, Overloaded Operators, and Arrays in Classes

Separate Compilation and Namespaces

Pointers and Linked Lists

Inheritance

Exception Handling

Templates

Standard Template Library

Filters

Exam 14: Recursion

A class member function may be recursive.

How do you ensure that your function does not have infinite recursion?

In a recursive function, the statements) that invoke the function again are called the ______________.

If you try to solve a problem recursively, you should

Recursive functions always execute faster than an iterative function.

The recursive definition of a Fibonacci Number is Fn) = Fn-1) + Fn-2), where F0)=1 and F1)=1. What is the value of Fib5)?

In the following function, how many recursive calls are there? Void towerschar source, char dest, char help, int numDisks) { IfnumDisks<1) { Return; } Else { Towerssource,help,dest,numDisks-1); Cout << "Move disk from " << source << " to " <<dest<<endl; Towershelp,dest,source,numDisks-1); } }

If your program makes too many recursive function calls, your program will cause a ___________

To ensure that your function recurses correctly and the proper result is reached, you must ensure that

What is wrong with the following recursive function? It should print out the array backwards. Void printint array[], int start, int size) { Ifstart == size) Return; Else { Printarray, start+1,size); Cout << array[start] << endl; } }

What is the output of the following code fragment? Int f1int x, int y) { Ifx<0 || y<0) Return x-y; Else Return f1x-1,y) + f1x,y-1); } Int main) { Cout << f12,1)<<endl; Return 0; }

What is the output of the following code fragment? Int f1int base, int limit) { Ifbase > limit) Return -1; Else Ifbase == limit) Return 1; Else Return base * f1base+1, limit); } Int main) { Cout << f12,4)<<endl; Return 0; }

Every time a recursive function call is executed, a new __________ is put on the top of the stack.

What is the output of the following code fragment? Int f1int n, int m) { Ifn < m) Return 0; Else ifn==m) Return m+ f1n-1,m); Else Return n+ f1n-2,m-1); } Int main) { Cout << f11,4); Return 0; }

What is wrong with the following recursive function? It should print out the array backwards. Void printint array[], int start, int size) { Ifstart < size) Return; Else { Printarray, start+1,size); Cout << array[start] << endl; } }

What is the output of the following code fragment? Int f1int n, int m) { Ifn < m) Return 0; Else ifn==m) Return m+ f1n-1,m); Else Return n+ f1n-2,m-1); } Int main) { Cout << f15,4); Return 0; }

If the recursive function call does not lead towards a stopping case, you have ______________.

Every recursive definition may be rewritten iteratively.

Introduction to Computer and C++ Programming

C++ Basics

More Flow of Control

Procedural Abstraction and Functions That Return a Value

Functions for All Sub Tasks

Io Streams As an Introduction to Objects and Classes

Arrays

Strings and Vectors

Pointers and Dynamic Arrays

Defining Classes

Friends, Overloaded Operators, and Arrays in Classes

Separate Compilation and Namespaces

Pointers and Linked Lists

Inheritance

Exception Handling

Templates

Standard Template Library

Filters