Question 1

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 2

Recursive function calls are __________ efficient than loops.

Accepted Answer

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

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

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

Accepted Answer

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

Question 5

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

Accepted Answer

The function is called once from the main function and then calls itself seven times, so the total number of recursive calls is 7. Therefore, the depth of recursion is 7.

Question 6

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

Accepted Answer

Recursive functions inherently include overhead actions, such as additional memory allocation for each function call, which are not necessary in a loop structure. Loops execute iteratively within the same frame of execution, avoiding the overhead associated with setting up and tearing down the stack frames required for each recursive call.

Question 7

Recursive functions are __________ iterative algorithms.

Accepted Answer

Recursive functions have higher overhead costs compared to iterative algorithms because they require function calls and stack operations. Therefore, iterative algorithms are usually more efficient than recursive functions.

Question 8

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

Accepted Answer

The answer of Some problems are more __________ solved with...

Question 9

What defines the depth of recursion?

Accepted Answer

The depth of recursion is defined by the number of times the function calls itself, which is option C. The length of the algorithm or the number of function calls do not necessarily define the depth of recursion, and while the number of times the function goes to the base case is related to recursion, it does not fully define the depth of recursion.

Question 10

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

Accepted Answer

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

Question 11

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

Accepted Answer

The answer of A solution using a(n)__________ is usually more...

Question 12

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 13

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

The base case in a recursive solution for finding the factorial of a number is when n = 0. At this point, we know that 0! = 1. This is the starting point for calculating the factorial of any other number greater than zero.

Question 14

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 15

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

Accepted Answer

The answer of Each time a function is called,the system...

Quiz 12: Recursion