Exam 15: Recursion

Which of the following problems can be solved recursively?

This occurs when method A calls method B, which in turn calls method A.

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

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

The actions performed by the JVM that take place with each method call are sometimes referred to as this.

Whereas a recursive algorithm might result in faster execution time, the programmer might be able to design an iterative algorithm faster.

A recursive method can have no more than one base case.

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

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

A method is called from the main method for the first time. It then calls itself seven times. What is the depth of recursion? A) 1 B) 7 C) 8 D) 6

The recursive binary search algorithm is a good example of repeatedly breaking a problem down into smaller pieces until it is solved.

A method that calls itself is a ________ method.

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

When recursive methods directly call themselves, it is known as this.

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

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

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

Recursion is never absolutely required to solve a problem.

The number of times that a method calls itself is known as

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