Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

A base case is not necessary for all recursive algorithms.

Accepted Answer

A) True 
 B)False

Question 3

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

Accepted Answer

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 4

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

Accepted Answer

The answer of Usually a problem solved by recursion is...

Question 5

Recursive function calls are __________ efficient than loops.

Accepted Answer

The answer of Recursive function calls are __________ efficient than...

Question 6

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

Accepted Answer

The answer of The base case does not require __________,so...

Question 7

What defines the depth of recursion?

Accepted Answer

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 8

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

Accepted Answer

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

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

Recursion is sometimes required to solve certain types of problems.

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

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

Question 13

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

Accepted Answer

The answer of A recursion in which a function directly...

Question 14

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

Accepted Answer

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 15

Recursion is

Accepted Answer

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

Exam 12: Recursion

A base case is not necessary for all recursive algorithms.

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

Recursion is

Correct Answer
verified

What defines the depth of recursion?

Correct Answer
verified

Recursion is sometimes required to solve certain types of problems.

Correct Answer
verified

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

Correct Answer
verified

Recursive function calls are __________ efficient than loops.

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

Exam 12: Recursion

A base case is not necessary for all recursive algorithms.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Recursion is

Correct AnswerverifiedShow Answer

What defines the depth of recursion?

Correct AnswerverifiedShow Answer

Recursion is sometimes required to solve certain types of problems.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Recursive function calls are __________ efficient than loops.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified