Question 1

The QuickSort algorithm is used to sort _____________.

Accepted Answer

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 A

Question 2

The __________ algorithm uses recursion to efficiently sort a list.

Accepted Answer

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

Question 3

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) ;
}
}

Accepted Answer

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

Question 4

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

Accepted Answer

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

Question 5

The QuickSort algorithm works on the basis of

Accepted Answer

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

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) ;
}
}

Accepted Answer

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

Question 7

The QuickSort algorithm was developed in 1960 by _________.

Accepted Answer

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

Question 8

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

Accepted Answer

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

Question 9

A recursive function cannot call another function.

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

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

Question 13

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

Accepted Answer

A) True 
 B)False

Question 14

Recursion can be used to:

Accepted Answer

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

Question 15

A __________ function is one that calls itself

Accepted Answer

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

Question 16

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.

Accepted Answer

A) True 
 B)False

Question 17

Recursive algorithms are less efficient than iterative algorithms.

Accepted Answer

A) True 
 B)False

Question 18

A recursive function that does not have a termination will eventually

Accepted Answer

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 19

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

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

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

Exam 19: Recursion

The QuickSort algorithm is used to sort _____________.

Correct AnswerverifiedA

The __________ algorithm uses recursion to efficiently sort a list.

Correct AnswerverifiedShow Answer

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) ; } }

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The QuickSort algorithm works on the basis of

Correct AnswerverifiedShow Answer

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) ; } }

Correct AnswerverifiedC

The QuickSort algorithm was developed in 1960 by _________.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A recursive function cannot call another function.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Recursion can be used to:

Correct AnswerverifiedShow Answer

A __________ function is one that calls itself

Correct AnswerverifiedShow Answer

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.

Correct AnswerverifiedShow Answer

Recursive algorithms are less efficient than iterative algorithms.

Correct AnswerverifiedShow Answer

A recursive function that does not have a termination will eventually

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedD

Correct Answer
verified
A

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
C

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
D