Exam 14: Recursion

A recursive method can have only one base case.

To use recursion for a binary search, what is required before the search can proceed?

A problem can be solved recursively if it can be broken down into successive smaller problems that are identical to the overall problem.

__________ occurs when method A calls method B which in turn calls method A

The __________ is at least one case in which a problem can be solved without recursion.

In a recursive program, the number of times a method calls itself is known as

Like a loop, a recursive method must have which of the following?

Recursion is never absolutely required to solve a problem.

The Towers of Hanoi is a mathematical game that is often used in computer science textbooks to illustrate the power of recursion.

A method is called from the main method for the first time. It then calls itself seven times. What is the depth of recursion?

When recursive methods directly call themselves, it is known as

Which of the following problems can be solved recursively?

In the following code that uses recursion to find the factorial of a number, what is the base case? private static int factorial(int n) { If (n == 0) Return 1; Else Return n * factorial(n - 1); }

A method that calls itself is a __________ method.

Without a base case, a recursive method will call itself only once and stop.

Recursion can be a powerful tool for solving repetitive problems and is an important topic in upper-level computer science courses.

In the __________, we must always reduce the problem to a smaller version of the original problem.

The recursive case does not require recursion so it stops the chain of recursive calls.

In the following code that uses recursion to find the greatest common divisor of a number, what is the base case? public static int gcd(int x, int y) { If (x % y == 0) Return y; Else Return gcd(y, x % y); }

Any problem that can be solved recursively can also be solved iteratively, with a loop.