Question 1

In a recursive power function that calculates some base to the exp power, what is the recursive call?

Accepted Answer

return base * powerbase,exp-1);

Question 2

A stack exhibits what behavior?

Accepted Answer

Last In - First Out

Question 3

A recursive function is a function that ______________.

Accepted Answer

calls itself

Question 4

If the recursive function call does not lead towards a stopping case, you have ______________.

Accepted Answer

The answer of If the recursive function call does not...

Question 5

Recursive functions must return a value.

Accepted Answer

Recursive functions do not necessarily have to return a value; they can perform actions without returning anything, similar to non-recursive void functions.

Question 6

In a recursive power function that calculates some base to a positive exp power, at what value of exp do you stop? The function will continually multiply the base times the value returned by the power function with the base argument one smaller.

Accepted Answer

The answer of In a recursive power function that calculates...

Question 7

What is the output of the following code fragment?
int f1int base, int limit)
{
ifbase > limit)
return -1;
else
ifbase == limit)
return 1;
else
return base * f1base+2, limit);
}
int main)
{
cout << f12,4)<<endl;
return 0;
}

Accepted Answer

The answer of What is the output of the following...

Question 8

Recursive functions may return any type of value

Accepted Answer

Recursive functions can return any type of value, including integers, floats, arrays, objects, etc.

Question 9

Only functions that do not return a value may be recursive.

Accepted Answer

Functions that return a value can also be recursive. The important point is that the function should call itself within its own definition.

Question 10

There can be more than one stopping case in a recursive function.

Accepted Answer

A recursive function can have multiple stopping cases based on different conditions.

Question 11

You may have at most 1 recursive call in a recursive function.

Accepted Answer

There are recursive algorithms that require more than one recursive calls, like the quicksort algorithm. However, it is generally recommended to keep the number of recursive calls to a minimum to avoid excessive memory usage and stack overflow.

Question 12

In a recursive function, the statements) that invoke the function again are called the ______________.

Accepted Answer

The answer of In a recursive function, the statements) that...

Question 13

Not all recursive definitions may be written iteratively.

Accepted Answer

Recursive algorithms can always be converted into iterative algorithms, although the process may sometimes be complex or result in less intuitive code.

Question 14

For every recursive solution, there is an) ______________ solution.

Accepted Answer

The answer of For every recursive solution, there is an)...

Question 15

Recursive functions always execute faster than an iterative function.

Accepted Answer

The statement is false. Recursive functions can be less efficient than iterative functions in terms of performance and memory usage. In some cases, recursive functions can lead to stack overflow errors if the recursion depth is too large. However, recursive functions can be easier to read and understand in certain scenarios. Iterative functions are typically faster and more memory efficient.

Question 16

How do you ensure that your function does not have infinite recursion?

Accepted Answer

The answer of How do you ensure that your function...

Question 17

A class member function may be recursive.

Accepted Answer

A class member function can be recursive, meaning that it can call itself. However, it is important to ensure that the recursion has a base case and will eventually terminate.

Question 18

Given the following code fragment, what is the stopping conditions)?
int f1int x, int y)
{
ifx<0 || y<0)
return x-y;
else
return f1x-1,y) + f1x,y-1);
}
int main)
{
cout << f11,2)<<endl;
return 0;
}

Accepted Answer

The answer of Given the following code fragment, what is...

Question 19

Every recursive definition may be rewritten iteratively.

Accepted Answer

Every recursive definition can be executed using an iterative process. This is known as tail recursion. However, it is not always convenient or efficient to do so.

Question 20

The operating system uses a stack to control recursion.

Accepted Answer

When a function is called recursively, the operating system uses a stack to keep track of the function calls and return addresses. This allows the program to deal with multiple functions executing at the same time and ensures that the correct value is returned to the correct function call.

Quiz 14: Recursion