FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 13: Recursion

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 21

Short Answer

Review LaterAdd Note

Review Later

Recursive algorithms can be written with modules or _____________ with a return value.

Correct Answer

verified

Show Answer

Question 22

Short Answer

Review LaterAdd Note

Review Later

When a recursive algorithm terminates its nth instance of the module call,it returns to the point in the __________ instance directly after the recursive module call.

Correct Answer

verified

Show Answer

Question 23

Multiple Choice

Review LaterAdd Note

If a recursive module calls itself ten times,after the tenth call it returns to the __________.

When setting up a recursive module,the part of the problem that can be solved without recursion is known as the __________ case.

If a module has called itself six times,the depth of recursion was ____________.

A recursive algorithm is never required to solve a problem.

The recursive calls stop when the conditional expression becomes _________.

When creating a recursive algorithm it is optional to identify the base case and the recursive case of the algorithm.

In a recursive call,the computer actions of setting up memory for parameters and local variables and storing the address of the program location where control returns after the module terminates is called ______________.

Recursive algorithms are more efficient that iterative algorithms.

Comparing the recursive algorithm of a binary search with its counterpart,without recursion,it is much more elegant and easier to understand.

In a recursive algorithm,the computer completes the base case first and then works on the recursive cases.

The first step in setting up a recursive module is to ________________________________.

Which of the following can be solved with recursion?

The depth of recursion refers to the length and complexity of the recursive algorithm.

When the recursive module makes the last call to itself,the If-Then statement's condition expression is _________.

One of the advantages of a recursive algorithm is that it does not matter how many recursive calls are made to a module; only one instance of the parameters are needed.

It is not necessary to have a conditional expression to terminate the recursive calls.

The choice between using recursion or a loop is primarily a __________ decision.

A problem can be solved with recursion if it can be broken down into ____________ that are identical to the overall problem.