Deck 14: Recursion

Question 1

The quicksort algorithm works on the basis of

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

Answer 1

D

Question 2

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

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

Answer 2

A

Question 3

The function

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 above

Answer 3

A

Question 4

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

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

Question 5

Indirect recursion means that a function calls itself several times.

Question 6

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

Question 7

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

Question 8

Recursive algorithms tend to be less efficient than iterative algorithms.

Question 9

The quicksort algorithm can be used to

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 above

Question 10

Recursion can be used to

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

Question 11

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.

Question 12

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

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 above

Question 13

The programmer must ensure that a recursive function does not become

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 above

Question 14

A recursive function cannot call a function other than itself.

Question 15

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

Question 16

A _ function is one that calls itself.

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

Question 17

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

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

Question 18

The QuickSort algorithm was developed in 1960 by

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

Question 19

The algorithm uses recursion to sort an array.

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

Question 20

The base case of a recursive function
A)is 0.

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