Recursion Function Usage

A function that is called by itself, either directly or indirectly is called a

• Super function

• Recursive function

• Main function

• None of the above

Which of the following problems can’t be solved using recursion?

• Factorial of a number

• Nth Fibonacci number

• Length of a string

• Problems without base case

In recursion, the condition for which the function will stop calling itself is ___________

• Best case

• Worst case

• Base case

• There is no such condition

What will happen when the following code is executed?

• The code will be executed successfully and no output will be generated

• The code will be executed successfully and random output will be generated

• The code will show a compile time error

• The code will run for some time and stop when the stack overflows

What is the output of the following code?

• 10

• 1

• 10 9 8 … 1 0

• 10 9 8 … 1

What is the base case of the program?

• return

• printf(“%d “, n)

• if(n == 0)

• my_recursive_function(n-1)

Which of the following statements is true?

• Recursion is always better than iteration

• Recursion uses more memory compared to iteration

• Recursion uses less memory compared to iteration

• Iteration is always better and simpler than recursion

Which of the following recursive formula can be used to find the factorial of a number?

• fact(n) = n * fact(n)

• fact(n) = n * fact(n+1)

• fact(n) = n * fact(n-1)

• fact(n) = n * fact(1)

Consider the following iterative implementation to find the factorial of a number:

Which of the following lines should be inserted to complete the above code?

• fact = fact + i

• fact = fact * i

• . i = i * fact

• i = i + factfact(n) = n * fact(n)

What is the output of the following code?

int fun1(int x, int y) {

if(x == 0)

return y;

else

return fun1(x - 1, x + y); }