Question 1

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 
A)  returned 
B)  received 
C)  amortized 
D)  zero 
E)  None of these D

Question 2

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 
A)  1 
B)  4 
C)  5 
D)  An infinite number of times C

Question 3

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)  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 4

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 
A)  shell sort 
B)  quicksort 
C)  binary sort 
D)  red/black sort 
E)  None of these

Question 5

Recursive algorithms are less efficient than iterative algorithms.

Accepted Answer

A) True 
 B)False

Question 6

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

A __________ function is one that calls itself

Accepted Answer

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

Question 8

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 
A)  direct recursion 
B)  indirect recursion 
C)  function swapping 
D)  perfect recursion 
E)  None of these

Question 9

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 
A)  Bjarne Stroustrup 
B)  Tony Gaddis 
C)  C.A.R. Hoare 
D)  C.M. Turner 
E)  None of these

Question 10

A recursive function cannot call another function.

Accepted Answer

A) True 
 B)False

Question 11

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 
A)  1 
B)  4 
C)  5 
D)  An infinite number of times

Question 12

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 
A)  three sublists 
B)  two sublists and a pivot 
C)  two pivots and a sublist 
D)  three pivots 
E)  None of these

Question 13

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 
A)  level 
B)  breadth 
C)  type 
D)  depth 
E)  None of these

Question 14

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 15

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

Accepted Answer

A) True 
 B)False

Question 16

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 
A)  return statement 
B)  base case 
C)  closing curly brace 
D)  last parameter 
E)  None of these

Question 17

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 
A)  compute factorials 
B)  find GCD's 
C)  traverse linked lists 
D)  All of these 
E)  None of these

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

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 20

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

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

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

The QuickSort algorithm is used to sort _____________.

The __________ algorithm uses recursion to efficiently sort a list.

Recursive algorithms are less efficient than iterative algorithms.

A recursive function that does not have a termination will eventually

A __________ function is one that calls itself

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

The QuickSort algorithm was developed in 1960 by _________.

A recursive function cannot call another function.

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

The QuickSort algorithm works on the basis of

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

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.

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

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

Recursion can be used to:

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

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

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

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

Searching and Sorting Arrays

Characters, C++-Strings, and More About the String Class

Structured Data

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Stacks and Queues

Binary Trees

Filters

Exam 19: Recursion

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

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

The QuickSort algorithm is used to sort _____________.

The __________ algorithm uses recursion to efficiently sort a list.

Recursive algorithms are less efficient than iterative algorithms.

A recursive function that does not have a termination will eventually

A __________ function is one that calls itself

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

The QuickSort algorithm was developed in 1960 by _________.

A recursive function cannot call another function.

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

The QuickSort algorithm works on the basis of

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

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.

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

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

Recursion can be used to:

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

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

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

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

Searching and Sorting Arrays

Characters, C++-Strings, and More About the String Class

Structured Data

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Stacks and Queues

Binary Trees

Filters