Exam 13: Recursion

If the problem cannot be solved now, then a recursive function reduces it to a smaller but similar problem and _____.

If a recursive solution is evident for a particular problem, and the recursive algorithm does not slow system performance by an intolerable amount, then recursion would be a good design choice.

Each time a function is called, the system incurs overhead that is not necessary with a loop.

Usually, a problem is reduced by making the value of one or more parameters _______________ with each recursive call.

What is referred to as the recursive case?

Recursive functions are _____ iterative algorithms.

A recursive function includes _____ which are not necessary in a loop structure.

Recursive algorithms are more concise and efficient than iterative algorithms.

Each time a function is called, the system incurs _______________ that is not necessary with a loop.

A base case is not necessary for all recursive algorithms.

There can be several functions involved in the recursion.

Recursive function calls are _______________ efficient than loops.

A problem can be solved with recursion if it can be broken down into _____ problems.

A function is called from the main function and then it calls itself five times. The depth of recursion is _______________.

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

In many cases a solution using recursion is more evident than a solution using a loop.

When function A calls function B, which in turn calls function A, it is known as indirect recursion.

What is referred to as the base case?

The majority of repetitive programming tasks are best done with _______________.

What is the second step that needs to be taken in order to apply a recursive approach?