Question 1

Recursion can be used to

Accepted Answer

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

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

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 4

The function

Accepted Answer

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

Question 5

The quicksort algorithm can be used to

Accepted Answer

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

Question 6

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.F) B) and D)
G) C) and D)

Question 7

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

Accepted Answer

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

Question 8

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

Accepted Answer

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

Question 9

Recursive algorithms tend to be less efficient than iterative algorithms.

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

A _ function is one that calls itself.

Accepted Answer

A)  dynamic
B)  static
C)  data validation
D)  recursive
E)  None of the aboveF) A) and C)
G) C) and E)

Question 12

The programmer must ensure that a recursive function does not become

Accepted Answer

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

Question 13

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 3 recursive calls.
C)  return after a chain of 2 recursive calls.
D)  return after a chain of 4 recursive calls.
E)  None of the aboveF) C) and D)
G) B) and C)

Question 14

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

Accepted Answer

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

Question 15

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

Accepted Answer

A)  breadth
B)  type
C)  depth
D)  level
E)  None of the aboveF) A) and B)
G) A) and C) C

Question 16

The quicksort algorithm works on the basis of

Accepted Answer

A)  two pivots and a sublist.
B)  three sublists.
C)  three pivots.
D)  two sublists and a pivot.
E)  None of the aboveF) B) and C)
G) None of the above D

Question 17

A recursive function cannot call a function other than itself.

Accepted Answer

A) True 
 B)False

Question 18

The algorithm uses recursion to sort an array.

Accepted Answer

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

Question 19

Indirect recursion means that a function calls itself several times.

Accepted Answer

A) True 
 B)False

Question 20

The QuickSort algorithm was developed in 1960 by

Accepted Answer

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

Exam 14: Recursion

Recursion can be used to

Correct AnswerverifiedE

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

Correct AnswerverifiedShow Answer

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.

Correct AnswerverifiedShow Answer

The function

Correct AnswerverifiedShow Answer

The quicksort algorithm can be used to

Correct AnswerverifiedShow Answer

The base case of a recursive function

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Recursive algorithms tend to be less efficient than iterative algorithms.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A _ function is one that calls itself.

Correct AnswerverifiedShow Answer

The programmer must ensure that a recursive function does not become

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedC

The quicksort algorithm works on the basis of

Correct AnswerverifiedD

A recursive function cannot call a function other than itself.

Correct AnswerverifiedShow Answer

The algorithm uses recursion to sort an array.

Correct AnswerverifiedShow Answer

Indirect recursion means that a function calls itself several times.

Correct AnswerverifiedShow Answer

The QuickSort algorithm was developed in 1960 by

Correct AnswerverifiedShow Answer

Correct Answer
verified
E

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
C

Correct Answer
verified
D

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified