Question 1

The base case of a recursive function

Accepted Answer

A)  is 0. 
B)  is 1. 
C)  is depth / 2. 
D)  is 1 / (depth * 3.1415). 
E)  depends on the problem being solved. 
A)  is 0. 
B)  is 1. 
C)  is depth / 2. 
D)  is 1 / (depth * 3.1415). 
E)  depends on the problem being solved. E

Question 2

The ________ algorithm uses recursion to sort an array.

Accepted Answer

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

Question 3

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

Question 4

Suppose that a recursive function with integer parameter n has a base case of 0, and for each non-base case, the function makes a recursive call with argument n+1. If the function is initially called with an actual argument of n = 3, the function call will

Accepted Answer

A)  cause an infinite chain of recursive calls. 
B)  return after a chain of 2 recursive calls. 
C)  return after a chain of 3 recursive calls. 
D)  return after a chain of 4 recursive calls. 
E)  None of the above 
A)  cause an infinite chain of recursive calls. 
B)  return after a chain of 2 recursive calls. 
C)  return after a chain of 3 recursive calls. 
D)  return after a chain of 4 recursive calls. 
E)  None of the above

Question 5

A recursive function should be designed to stop making recursive calls when it reaches its

Accepted Answer

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

Question 6

A ________ function is one that calls itself.

Accepted Answer

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

Question 7

The programmer must ensure that a recursive function does not become

Accepted Answer

A)  a static function. 
B)  a prototyped function. 
C)  trapped in an infinite chain of recursive calls. 
D)  a dynamic function. 
E)  None of the above 
A)  a static function. 
B)  a prototyped function. 
C)  trapped in an infinite chain of recursive calls. 
D)  a dynamic function. 
E)  None of the above

Question 8

Recursion can be used to

Accepted Answer

A)  compute factorials. 
B)  find the greatest common divisor of two integers (GC
D) . 
C)  program things that cannot be programmed without recursion. 
D)  All of the above 
E)  Both A and B, but not C 
A)  compute factorials. 
B)  find the greatest common divisor of two integers (GC
D) . 
C)  program things that cannot be programmed without recursion. 
D)  All of the above 
E)  Both A and B, but not C

Question 9

The function int fact(int k)
{
Return k*fact(k-1);
If (k==0) return 1;
}

Accepted Answer

A)  computes the factorial on an integer k passed to it as parameter. 
B)  returns the value 1 if it is passed a value of 0 for the parameter k. 
C)  does not correctly handle its base case. 
D)  works for all non-negative values of k, but not for negative numbers. 
E)  None of the above 
A)  computes the factorial on an integer k passed to it as parameter. 
B)  returns the value 1 if it is passed a value of 0 for the parameter k. 
C)  does not correctly handle its base case. 
D)  works for all non-negative values of k, but not for negative numbers. 
E)  None of the above

Question 10

The QuickSort algorithm was developed in 1960 by

Accepted Answer

A)  Bjarne Stroustrup. 
B)  Tony Gaddis. 
C)  C.A.R. Hoare. 
D)  Judy Walters. 
E)  None of the above 
A)  Bjarne Stroustrup. 
B)  Tony Gaddis. 
C)  C.A.R. Hoare. 
D)  Judy Walters. 
E)  None of the above

Question 11

When a function A calls a function B, which in turn calls A, we have

Accepted Answer

A)  direct recursion. 
B)  indirect recursion. 
C)  function call cycling. 
D)  perfect recursion. 
E)  None of the above 
A)  direct recursion. 
B)  indirect recursion. 
C)  function call cycling. 
D)  perfect recursion. 
E)  None of the above

Question 12

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

Question 13

Any algorithm that can be coded with recursion can also be coded using a loop.

Accepted Answer

A) True 
 B)False

Question 14

The speed and amount of memory available to modern computers diminishes the performance impact of the overhead of recursion so much that for many applications, this overhead is not noticeable.

Accepted Answer

A) True 
 B)False

Question 15

Indirect recursion means that a function calls itself several times.

Accepted Answer

A) True 
 B)False

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

A recursive function cannot call a function other than itself.

Accepted Answer

A) True 
 B)False

Question 18

Recursive algorithms tend to be less efficient than iterative algorithms.

Accepted Answer

A) True 
 B)False

Question 19

A recursive function that does not correctly handle its base case may

Accepted Answer

A)  return 0 and stop. 
B)  return FALSE and stop. 
C)  cause an infinite chain of recursive calls. 
D)  reach the NULL terminator and stop. 
E)  None of the above 
A)  return 0 and stop. 
B)  return FALSE and stop. 
C)  cause an infinite chain of recursive calls. 
D)  reach the NULL terminator and stop. 
E)  None of the above

Question 20

The quicksort algorithm can be used to

Accepted Answer

A)  sort lists stored in arrays. 
B)  perform binary search on arrays. 
C)  quickly sort and search arrays. 
D)  All of the above 
E)  None of the above 
A)  sort lists stored in arrays. 
B)  perform binary search on arrays. 
C)  quickly sort and search arrays. 
D)  All of the above 
E)  None of the above

The base case of a recursive function

The ________ algorithm uses recursion to sort an array.

The quicksort algorithm works on the basis of

Suppose that a recursive function with integer parameter n has a base case of 0, and for each non-base case, the function makes a recursive call with argument n+1. If the function is initially called with an actual argument of n = 3, the function call will

A recursive function should be designed to stop making recursive calls when it reaches its

A ________ function is one that calls itself.

The programmer must ensure that a recursive function does not become

Recursion can be used to

The function int fact(int k) { Return k*fact(k-1); If (k==0) return 1; }

The QuickSort algorithm was developed in 1960 by

When a function A calls a function B, which in turn calls A, we have

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

Any algorithm that can be coded with recursion can also be coded using a loop.

The speed and amount of memory available to modern computers diminishes the performance impact of the overhead of recursion so much that for many applications, this overhead is not noticeable.

Indirect recursion means that a function calls itself several times.

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

A recursive function cannot call a function other than itself.

Recursive algorithms tend to be less efficient than iterative algorithms.

A recursive function that does not correctly handle its base case may

The quicksort algorithm can be used to

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, Algorithm Analysis

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library Stl

Linked Lists

Stacks and Queues

Binary Trees

Filters

Exam 14: Recursion

The base case of a recursive function

The ________ algorithm uses recursion to sort an array.

The quicksort algorithm works on the basis of

Suppose that a recursive function with integer parameter n has a base case of 0, and for each non-base case, the function makes a recursive call with argument n+1. If the function is initially called with an actual argument of n = 3, the function call will

A recursive function should be designed to stop making recursive calls when it reaches its

A ________ function is one that calls itself.

The programmer must ensure that a recursive function does not become

Recursion can be used to

The function int fact(int k) { Return k*fact(k-1); If (k==0) return 1; }

The QuickSort algorithm was developed in 1960 by

When a function A calls a function B, which in turn calls A, we have

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

Any algorithm that can be coded with recursion can also be coded using a loop.

The speed and amount of memory available to modern computers diminishes the performance impact of the overhead of recursion so much that for many applications, this overhead is not noticeable.

Indirect recursion means that a function calls itself several times.

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

A recursive function cannot call a function other than itself.

Recursive algorithms tend to be less efficient than iterative algorithms.

A recursive function that does not correctly handle its base case may

The quicksort algorithm can be used to

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, Algorithm Analysis

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library Stl

Linked Lists

Stacks and Queues

Binary Trees

Filters