FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 12: Recursion

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

Short Answer

Review LaterAdd Note

Review Later

Recursive function calls are _______________ efficient than loops.

Correct Answer

verified

less

Question 2

Multiple Choice

Review LaterAdd Note

Review Later

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

A) Identify at least one case in which the problem can be solved without recursion.
B) Determine a way to solve the problem in all other circumstances using recursion.
C) Identify a way to stop the recursion.
D) Determine a way to return to the main function.

E) A) and B)
F) C) and D)

Correct Answer

verified

Show Answer

Question 3

Multiple Choice

Review LaterAdd Note

The process of calling a function requires _____.

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

Recursive algorithms are more concise and efficient than iterative algorithms.

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

Recursion is required to solve some type of problems.

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

Some problems are _______________ solved with recursion than with a loop.

A base case is not necessary for all recursive algorithms.

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

There can be several functions involved in the recursion.

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

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

The base case is a case in which the problem can be solved without _____.

A solution using a(n) _______________ is usually more evident than a recursive solution.

A recursive function must have some way to control the number of times it repeats.

A problem can be solved with recursion if it can be broken into smaller problems that are identical in structure to the overall problem.

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.

Recursive functions are _____ iterative algorithms.