Exam 8: Recursion

C++ maintains a stack, on which it saves new information in the form of a(n) __________ frame.

Which algorithm segment completes the definition for an iterative version of the factorial function? Int factorial_i (int n) { Int result = 1; /** missing code inserted here */ __________ Return result ; }

Because we eliminate at least __________ of the elements from consideration with each recursive call, binary search is an O(log n) algorithm.

Suppose the function size is called with the argument "ace". When size is later recursively called with the argument "ce", the saved state is represented with the activation frame: str: "ce" "ce" == "" is true return 1 + size("e");

A recursive problem-solving strategy has divided a problem of size n into two parts. If the larger problem consists of n - 1 items, the smaller problem consists of __________ item (s).

The recursive case in the size function below has been incorrectly altered. If the function is called with str = "palindrome", the internal algorithm __________.

__________ is an approach to implementing systematic trial and error in a search for a solution.

When performing a binary search against a vector with 262,144 items, __________ probes are required in the worst case scenario.

Which of the following recursive calls enables the fibo function to perform in linear time?

A recursive algorithm will stop subdividing a problem after reaching the __________ case.

A proof by __________ works the following way: • Prove the theorem is true for the base case of (usually) n = 0 or n = 1. • Show that if the theorem is assumed true for n, then it must be true for n + 1.

The process of returning from the recursive calls and computing the partial results is called __________ the recursion.

The function below is called a(n) __________ function because its only purpose it to call the recursive fibo function and return its result. int fibonacci_start(int n) { return fibo(1, 0, n); }

Binary search must be performed on a(n) __________ array.

Rather than examining the last vector element, binary search compares the "__________" element to the target.

On average, a linear search will examine __________ items to find the target if it is in the vector.

Complete the revision to the power function below.

Suppose you passed 50 to the naive recursive version of the fibonacci function appearing below. If your CPU could process one million activation frames per second, approximately how much time would the function require to compute the return value?

We can always write an iterative solution to a problem that is solvable by recursion.

To complete the recursive call to gcd, which argument set should be inserted?