Deck 19: Recursion

Question 1

The QuickSort algorithm works on the basis of

A) three sublists
B) two sublists and a pivot
C) two pivots and a sublist
D) three pivots
E) None of these

Answer 1

B

Question 2

A recursive function is designed to terminate when it reaches its ________.

A) return statement
B) base case
C) closing curly brace
D) last parameter
E) None of these

Answer 2

B

Question 3

The __________ algorithm uses recursion to efficiently sort a list.

A) shell sort
B) quicksort
C) binary sort
D) red/black sort
E) None of these

Answer 3

B

Question 4

A __________ function is one that calls itself

A) dynamic
B) static
C) recursive
D) data validation
E) None of these

Question 5

When recursion is used on a linked list, it will always display the contents of the list in reverse order.

Question 6

How many times will the following function call itself, if 5 is passed as the argument? void showMessage(int n)
{
If (n > 0)
{
Cout << "Good day!" << endl;
ShowMessage(n + 1);
}
}

A) 1
B) 4
C) 5
D) An infinite number of times

Question 7

Recursion can be used to:

A) compute factorials
B) find GCD's
C) traverse linked lists
D) All of these
E) None of these

Question 8

The QuickSort algorithm was developed in 1960 by _________.

A) Bjarne Stroustrup
B) Tony Gaddis
C) C.A.R. Hoare
D) C.M. Turner
E) None of these

Question 9

The QuickSort algorithm is used to sort _____________.

A) lists stored in arrays or linear linked lists
B) tree data structures
C) randomly-ordered files
D) All of these
E) None of these

Question 10

A recursive function cannot call another function.

Question 11

A recursive function that does not have a termination will eventually

A) return 0 and stop
B) return false and stop
C) cause the program to crash
D) reach the Null terminator and stop
E) None of these

Question 12

Any algorithm that can be coded with recursion can also be coded with an iterative structure.

Question 13

Indirect recursion means that a function calls itself n number of times, then processing of the function starts from the first call.

Question 14

How many times will the following function call itself, if 5 is passed as the argument? void showMessage(int n)
{
If (n > 0)
{
Cout << "Good day!" << endl;
ShowMessage(n - 1);
}
}

A) 1
B) 4
C) 5
D) An infinite number of times

Question 15

The programmer must ensure that a recursive function does not become:

A) a static function
B) a prototyped function
C) like an endless loop
D) a dynamic function
E) None of these

Question 16

When function A calls function B, which in turn calls function A, this is known as:

A) direct recursion
B) indirect recursion
C) function swapping
D) perfect recursion
E) None of these

Question 17

The recursive factorial function calculates the factorial of its parameter. Its base case is when the parameter is _______.

A) returned
B) received
C) amortized
D) zero
E) None of these

Question 18

When a recursive function directly calls itself, this is known as direct recursion.

Question 19

The __________ of recursion is the number of times a recursive function calls itself.

A) level
B) breadth
C) type
D) depth
E) None of these

Question 20

Recursive algorithms are less efficient than iterative algorithms.

Question 21

The speed and amount of memory available to modern computers diminishes the performance impact of recursion so much that inefficiency is no longer a strong argument against it.