Java Chapter 15 Review Questions

A method is called once from the program's main method, and then it calls itself four times. The depth of recursion is:

• one

• four

• five

• nine

This is the part of a problem that can be solved without recursion

• base case

• solvable case

• known case

• iterative case

This is the part of a problem that is solved with recursion

• base case

• iterative case

• unknown case

• recursion case

This is when a method explicitly calls itself

• explicit recursion

• modal recursion

• direct recursion

• indirect recursion

This is when method A calls method B, which calls method A.

• implicit recursion

• modal recursion

• direct recursion

• indirect recursion

This refers to the actions taken internally by the JVM when a method is called.

• overhead

• set up

• clean up

• synchronization

An iterative algorithm will usually run faster than an equivalent recursive algorithm

• True

• False

Some problems can be solved through recursion only

• True

• False

It is not necessary to have a base case in all recursive algorithms

• True

• False

In the base case, a recursive method calls itself with a smaller version of the original problem.

• True

• False