Deck 15: Recursion

Question 1

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

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

Answer 1

B

Question 2

Infinite recursions execute forever on a computer.

Answer 2

False

Question 3

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

Answer 3

A

Question 4

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

Question 5

The following is an example of a recursive function.

Question 6

Consider the following definition of the recursive function print. 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

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

Question 8

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

Question 9

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

Question 10

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

Question 11

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.

Question 12

The ____ case is the case for which the solution to an equation is obtained directly.

A) general
B) base
C) direct
D) tail

Question 13

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

Question 14

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

Question 15

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

Question 16

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

Question 17

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

Question 18

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

Question 19

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

Question 20

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

Question 21

Recursive algorithms are implemented using ____________________ functions.

Question 22

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

A) 10
B) 21
C) 42
D) 420

Question 23

Suppose that function A calls function B, function B calls function C, function C calls function D, and function D calls function A.Function A is then ____________________ recursive.

Question 24

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

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

Question 25

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

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

Question 26

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

Question 27

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

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

Question 28

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

A) 720
B) 5040
C) 5760
D) 10800

Question 29

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

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 30

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

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 31

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

Question 32

Consider the accompanying definition of the recursive function mystery.Given the declaration:int alpha[5] = {1, 4, 5, 8, 9}; what is the output of the following statement?
Cout << mystery(alpha, 0, 4) << endl;

A) 1
B) 18
C) 27
D) 35

Question 33

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

Question 34

A function is called ____ if it calls itself.

A) directly iterative
B) indirectly iterative
C) directly recursive
D) indirectly recursive

Question 35

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

A) 50
B) 65
C) 120
D) 180

Question 36

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

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

Question 37

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;

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

Question 38

How many needles are used in the Tower of Hanoi problem?

A) one
B) two
C) three
D) four

Question 39

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

A) Recursive
B) Iterative
C) Procedural
D) Step-by-step

Question 40

Which of the following solution methods would be the best choice for a mission control system?

A) Iterative
B) Direct recursive
C) Indirect recursive
D) Infinite recursive

Question 41

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

Question 42

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

Question 43

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