C++ Recursion

Which of the following is the best definition of a recursive method?

• A method that iterates itself exactly 5 times.

• A method that invokes itself by name within the method.

• A method that will never iterate infinitely.

• A method that cannot be called more than once.

Name the condition at which the recursive method will stop calling itself.

• Base case

• Worst Case

• Best Case

• None of the above

Predict output of following program 

int fun(int n)

{

if (n == 4)

return n;

else

return 2*fun(n+1);

}

int main() {

printf("%d", fun(2)); return 0; }

• 4

• 8

• 16

• None

What will be the output of the following C code?

int main()

{

printf("Hello");

main();

return 0;

}

• Hello is printed once

• Hello infinite number of times

• Hello is not printed at all

• 0 is returned

The data structure used to implement recursive function calls _____________

• Array

• Linked list

• Binary tree

• Stack

What is the C keyword that must be used to get the expected result using Recursion?

• printf

• void

• break

• return

The following function finds the factorial of any number

int factorial(int n)

{

if(n == 0 || n == 1) return 1;

return n * factorial(n-1);

}

What would calling factorial(4) output?

• 24

• 16

• 8

• 64

int fibo(int n)

{

if(n == 0 || n == 1) return n;

return _________________;

}

• fib (n-1)+fib (n-2)

• fibo(n-1)+fibo(n-2)

• fibo(n*2)

• fibo(n+1)+fibo(n+2)

What is the following recursive function missing?

int funTwo(int x, int y){

if (x == 0)

cout<< y;

else

cout<< fun1(x - 1, x + y);

}

• A base case

• A general case

• the braces

• A return statement

Recursion is similar to which of the following?

• if-else

• switch-case

• loops

• none of the above