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

Multiple Choice

Review LaterAdd Note

Review Later

If a problem can be solved immediately without recursion,then the recursive function

A) solves it and returns
B) exits
C) returns a default value
D) generates a run-time error

Correct Answer

verified

Show Answer

Question 2

Multiple Choice

Review LaterAdd Note

Review Later

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

A) smaller
B) one-line
C) manageable
D) modular

Correct Answer

verified

Show Answer

Question 3

Multiple Choice

Review LaterAdd Note

If,in a recursive solution,function A calls function B which calls function C,this is called __________ recursion.

All the cases of a recursive solution other than the base case are called the __________ case.

The process of calling a function requires

Recursive functions are __________ iterative algorithms.

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

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

Recursive algorithms are always more concise and efficient than iterative algorithms.

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.

Each time a function is called in a recursive solution,the system incurs overhead that is not incurred with a loop.

What is the second step to take in order to apply a recursive approach?

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

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

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

In a recursive solution,if the problem cannot be solved now,then a recursive function reduces it to a smaller but similar problem and

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

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

Some problems are more __________ solved with recursion than with a loop.