Question 1

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

Accepted Answer

A) True 
 B)False  True

Question 2

Consider the following code.
   The function fact is an example of a(n) ____________________ recursive function.

Accepted Answer

tail

Question 3

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

Accepted Answer

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

Question 4

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

Accepted Answer

A)  void rFibNum(int a, int b) 
B)  bool rFibNum(int a, int b) 
C)  bool rFibNum(int a, int b, int n) 
D)  int rFibNum(int a, int b, int n) 
A)  void rFibNum(int a, int b) 
B)  bool rFibNum(int a, int b) 
C)  bool rFibNum(int a, int b, int n) 
D)  int rFibNum(int a, int b, int n)

Question 5

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

Accepted Answer

The answer of The ____________________ Fibonacci number in a sequence...

Question 6

-Consider the accompanying definition of the recursive function mystery.Given the declaration:int beta[10] = {2, 5, 8, 9, 13, 15, 18, 20, 23, 25}; What is the output of the following statement?
Cout << mystery(beta, 4, 7) << endl;

Accepted Answer

A)  27 
B)  33 
C)  55 
D)  66 
A)  27 
B)  33 
C)  55 
D)  66

Question 7

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

Accepted Answer

A)  10 
B)  11 
C)  100 
D)  110 
A)  10 
B)  11 
C)  100 
D)  110

Question 8

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

Accepted Answer

A)  Only two disks can be moved at a time. 
B)  You can remove disks only from the first needle. 
C)  The removed disk must be placed on a smaller disk. 
D)  A smaller disk can be placed on top of a larger disk. 
A)  Only two disks can be moved at a time. 
B)  You can remove disks only from the first needle. 
C)  The removed disk must be placed on a smaller disk. 
D)  A smaller disk can be placed on top of a larger disk.

Question 9

The following is an example of a recursive function, where nextNum is a function such that nextNum(x) = x + 1.

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

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

Accepted Answer

A)  direct 
B)  indirect 
C)  tail 
D)  iterative 
A)  direct 
B)  indirect 
C)  tail 
D)  iterative

Question 12

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

Accepted Answer

A)  13 
B)  21 
C)  40 
D)  42 
A)  13 
B)  21 
C)  40 
D)  42

Question 13

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

A) True 
 B)False

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

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

Accepted Answer

A)  Iterative 
B)  Recursive 
C)  Procedural 
D)  Object 
A)  Iterative 
B)  Recursive 
C)  Procedural 
D)  Object

Question 16

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

Accepted Answer

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

Question 17

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 ____________________.

Accepted Answer

The answer of In the Tower of Hanoi problem, if...

Question 18

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

Accepted Answer

A)  unlimited 
B)  indefinite 
C)  infinite 
D)  tail 
A)  unlimited 
B)  indefinite 
C)  infinite 
D)  tail

Question 19

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

Accepted Answer

The answer of If you execute an infinite recursive function...

Question 20

Recursive algorithms are implemented using ____________________ functions.

Accepted Answer

The answer of Recursive algorithms are implemented using ____________________ functions....

Exam 15: Recursion

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

Consider the following code. The function fact is an example of a(n) ____________________ recursive function.

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

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

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

-Consider the accompanying definition of the recursive function mystery.Given the declaration:int beta[10] = {2, 5, 8, 9, 13, 15, 18, 20, 23, 25}; What is the output of the following statement? Cout << mystery(beta, 4, 7) << endl;

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

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

The following is an example of a recursive function, where nextNum is a function such that nextNum(x) = x + 1.

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

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

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

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.

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

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

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

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 ____________________.

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

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

Recursive algorithms are implemented using ____________________ functions.

An Overview of Computers and Programming Languages

Basic Elements of C++

Inputoutput

Control Structures I Selection

Control Structures Ii Repetition

User-Defined Function

Namespaces, the Class String, and User-Defined Simple Data Types

Arrays

Records Structs

Classes and Data Abstraction

Inheritance and Composition

Pointers, Classes, Virtual Functions, and Abstract Classes

Operator Overloading and Templates

Exception Handling

Linked Lists

Stacks and Queue

Searching and Sorting Algorithms

Binary Trees

Graph Algorithms

Standard Template Library

Filters