Programming Logic and Design, Chapter 13

Base case

The part of a problem that can be solved without recursion is the __________.

Recursive case

The part of a problem that is solved with recursion is the __________.

True

True/False. A recursive algorithm must reduce the problem to a smaller version of the original problem in the recursive case.

False

True/False. A recursive algorithm must solve the problem with recursion in the base case.

True

True/False. Any algorithm that can be coded with recursion can also be coded with a loop.

Direct recursion

When a module explicitly calls itself it is called __________.

Indirect recursion

When module A calls module B, which calls module A, it is called __________.

The Towers of Hanoi

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

4

A module is called once from a program's main module, and then it calls itself four times. The depth of recursion is __________.

Recursive module

A module that calls itself is known as a(n) __________.

Overhead

Actions taken by the computer when a module is called, such as allocating memory for parameters and local variables, are referred to as __________.

Depth of recursion

The number of times that a module calls itself is known as the __________.