Deck 12: Recursion

Question 1

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

Answer 1

True

Question 2

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) exits
B) returns to the main function
C) returns to the calling function
D) calls itself to solve the smaller problem

Answer 2

D

Question 3

The process of calling a function requires

A) a slow 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 3

C

Question 4

What is the first step to take 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 circumstances using recursion.
C) Identify a way to stop the recursion.
D) Determine a way to return to the main function.

Question 5

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

Question 6

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.

Question 7

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

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

Question 8

There must be only one function involved in any recursive solution.

Question 9

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

Question 10

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

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

Question 11

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

Question 12

When,in a recursive solution,function A calls function B which,in turn,calls function A,this is known as indirect recursion.

Question 13

Recursion is sometimes required to solve certain types of problems.

Question 14

Which of the following describes the base case in a recursive solution?

A) a case in which the problem can be solved without recursion
B) the case in which the problem is solved through recursion
C) the way to stop the recursion
D) the way to return to the main function

Question 15

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.

Question 16

Recursion is

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

Question 17

A base case is not necessary for all recursive algorithms.

Question 18

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

Question 19

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 20

In many cases it is easier to see how to solve a problem with recursion than with a loop.

Question 21

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

Question 22

Recursive function calls are __________ efficient than loops.

Question 23

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

Question 24

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

Question 25

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

A) 8
B) 2
C) 1
D) 7

Question 26

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 27

Recursive functions are __________ iterative algorithms.

A) more efficient than
B) less efficient than
C) as efficient as
D) impossible to compare to

Question 28

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

Question 29

What defines the depth of recursion?

A) the length of the algorithm
B) the number of function calls
C) the number of times the function calls itself
D) the number of times the function goes to the base case

Question 30

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

Question 31

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

Question 32

Usually a problem solved by recursion is reduced by making the value of one or more parameters __________ with each recursive call.

Question 33

Which would be the base case in a recursive solution to the problem of finding the factorial of a number. Recall that the factorial of a non-negative whole number is defined as n! where:
If n = 0,then n! = 1
If n > 0,then n! = 1 x 2 x 3 x ...
X n

A) n = 0
B) n = 1
C) n > 0
D) The factorial of a number cannot be solved with recursion.

Question 34

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

Question 35

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