Question 1

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  False

Question 2

The __________ algorithm uses recursion to 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 B

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

In a recursive solution, the base case is always the first case to be called.

Accepted Answer

A) True 
 B)False

Question 5

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

Question 6

A recursive function cannot call another function.

Accepted Answer

A) True 
 B)False

Question 7

Like a loop, a recursive function must have some method to control the number of times it repeats.

Accepted Answer

A) True 
 B)False

Question 8

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 9

If a recursive algorithm does not contain a base case, it

Accepted Answer

A)  returns 0 and stops 
B)  returns False and stops 
C)  uses up all available stack memory, causing the program to crash 
D)  reaches the recursive case and stops 
E)  None of these 
A)  returns 0 and stops 
B)  returns False and stops 
C)  uses up all available stack memory, causing the program to crash 
D)  reaches the recursive case and stops 
E)  None of these

Question 10

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 11

A __________ function is one that calls itself.

Accepted Answer

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

Question 12

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 13

The following code is an example of a __________ recursive algorithm. int myRecursion(int array[], int first, int last, int val)
{
int num;
if (first > last)
$\quad$return -1;
num = (first + last)/2;
if (array[num] == val)
$\quad$return num;
if (array[num] < val)
$\quad$return myRecursion(array, num + 1, last, val);
else
$\quad$return myRecursion(array, first, num - 1, val);
}

Accepted Answer

A)  Towers of Hanoi 
B)  QuickSort 
C)  binary search 
D)  doubly linked list 
E)  None of these 
A)  Towers of Hanoi 
B)  QuickSort 
C)  binary search 
D)  doubly linked list 
E)  None of these

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

All mathematical problems are designed to be more efficient using recursive solutions.

Accepted Answer

A) True 
 B)False

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

Recursive algorithms are less efficient than iterative algorithms.

Accepted Answer

A) True 
 B)False

Question 18

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

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 19

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

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 20

A recursive function is designed to terminate when it reaches its

Accepted Answer

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

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

The __________ algorithm uses recursion to sort a list.

The QuickSort algorithm is used to sort

In a recursive solution, the base case is always the first case to be called.

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

A recursive function cannot call another function.

Like a loop, a recursive function must have some method to control the number of times it repeats.

The QuickSort algorithm was developed in 1960 by

If a recursive algorithm does not contain a base case, it

The QuickSort algorithm works on the basis of

A __________ function is one that 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.

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

All mathematical problems are designed to be more efficient using recursive solutions.

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

Recursive algorithms are less efficient than iterative algorithms.

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

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

A recursive function is designed to terminate when it reaches its

Introduction to Computers and Programming

Introduction to C

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays and Vectors

Searching and Sorting Arrays

Pointers

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

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions and Templates

The Standard Template Library

Linked Lists

Stacks and Queues

Binary Trees

Filters

Exam 20: Recursion

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

The __________ algorithm uses recursion to sort a list.

The QuickSort algorithm is used to sort

In a recursive solution, the base case is always the first case to be called.

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

A recursive function cannot call another function.

Like a loop, a recursive function must have some method to control the number of times it repeats.

The QuickSort algorithm was developed in 1960 by

If a recursive algorithm does not contain a base case, it

The QuickSort algorithm works on the basis of

A __________ function is one that 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.

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

All mathematical problems are designed to be more efficient using recursive solutions.

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

Recursive algorithms are less efficient than iterative algorithms.

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

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

A recursive function is designed to terminate when it reaches its

Introduction to Computers and Programming

Introduction to C

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays and Vectors

Searching and Sorting Arrays

Pointers

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

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions and Templates

The Standard Template Library

Linked Lists

Stacks and Queues

Binary Trees

Filters

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

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