Deck 12: Recursion

Question 1

The process of calling a function requires _____.

A) a long memory access
B) a quick memory access
C) several actions to be performed by the computer
D) one action to be performed by the computer

Answer 1

C

Question 2

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.

Answer 2

A

Question 3

What is referred to as the recursive case?

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

Answer 3

B

Question 4

What is referred to as the base case?

A) At least one case in which the problem can be solved without recursion
B) The circumstances to solve the problem using recursion
C) The way to stop the recursion
D) The way to return to the main function

Question 5

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

A) Eight
B) Two
C) One
D) Seven

Question 6

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.

Question 7

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

Question 8

Function A calls function B, which calls function C, which calls function A. This is called _____ recursion.

A) continuous
B) direct
C) three function call
D) indirect

Question 9

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

A) loops
B) if
C) objects
D) recursion

Question 10

There can be several functions involved in the recursion.

Question 11

What is the second 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 use recursion in order to solve the problem in all circumstances which cannot be solved without recursion.
C) Identify a way to stop the recursion.
D) Determine a way to return to the main function.

Question 12

Recursive functions are _____ iterative algorithms.

A) more efficient than
B) less efficient than
C) as efficient as
D) incomparable to

Question 13

What defines the depth of recursion?

A) The length of the algorithm
B) The numbers of function calls
C) The number of times the function calls itself
D) The number of times it goes back to the main function

Question 14

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

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

Question 15

Recursion is _____.

A) never required to solve a problem
B) required to solve mathematical problems
C) never required to solve string problems
D) required to solve some problems

Question 16

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

Question 17

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

A) function calls
B) conditional clauses
C) overhead actions
D) object instances

Question 18

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

A) solves it and returns
B) Exits
C) returns the result
D) generates a run-time error

Question 19

A base case is not necessary for all recursive algorithms.

Question 20

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

A) exits
B) returns to the main function
C) returns to the calling function
D) calls itself to solve the smaller problem

Question 21

Recursive function calls are _______________ efficient than loops.

Question 22

The base case does not require _______________, so it stops the chain of recursive calls.

Question 23

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

Question 24

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

Question 25

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

Question 26

Recursive algorithms are more concise and efficient than iterative algorithms.

Question 27

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

Question 28

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

Question 29

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

Question 30

Recursion is required to solve some type of problems.

Question 31

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

Question 32

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

Question 33

A recursion in which a function directly calls itself is known as _______________ recursion.

Question 34

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

Question 35

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