Question 1

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 _______________,...

Question 2

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 3

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

Accepted Answer

The answer of A function is called from the main...

Question 4

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

Accepted Answer

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

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

What defines the depth of recursion?

Accepted Answer

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 7

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

Accepted Answer

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

Question 8

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

Accepted Answer

The answer of All the cases of the recursive solution...

Question 9

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

Accepted Answer

The answer of The majority of repetitive programming tasks are...

Question 10

Recursion is _____.

Accepted Answer

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 11

What is referred to as the recursive case?

Accepted Answer

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

Question 12

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

Accepted Answer

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

Question 13

What is referred to as the base case?

Accepted Answer

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 14

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

Accepted Answer

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

Question 15

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

Accepted Answer

A) True 
 B)False

Exam 12: Recursion

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

Correct Answer
verified

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

Correct Answer
verified

Recursion is _____.

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

What is referred to as the recursive case?

Correct Answer
verified

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

Correct Answer
verified

What is referred to as the base case?

Correct Answer
verified

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

Correct Answer
verified

What defines the depth of recursion?

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

Exam 12: Recursion

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Recursion is _____.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

What is referred to as the recursive case?

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

What is referred to as the base case?

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

What defines the depth of recursion?

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

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