MCQs of Recursion (Programming for Problem Solving - 3110003)

Showing 11 to 10 out of 20 Questions

11.

The data structure used to implement recursive function calls _____

12.

What is the output?

main()
{
int n,i;
n=f(6);
printf("%d",n);
}
f(int x)
{
if(x==2)
return 2;
else
{
printf("+");
f(x-1);
}
}

13.

What is the output?

main()
{
int n=10;
int f(int n);
printf("%d",f(n));
}
int f(int n)
{
if(n>0)
return(n+f(n-2));
}

14.

What is the output?
int main()
{
printf("Hello");
main();
return 0;
}

(a)	Hello is printed once
(b)	Hello infinite number of times
(c)	Hello is not printed at all
(d)	0 is returned

15.

Which of the following is true?

(a)	Recursion is always better than iteration
(b)	Recursion uses more memory compared to iteration
(c)	Recursion uses less memory compared to iteration
(d)	Iteration is always better and simpler than recursion

16.

What is the output of func(4);?

int func(int number)
{
if(number <= 0)
return 1;
else
return number * func(number-1);
}

17.

What is the output of func(3,8)?

int func(int a, int b)
{
if(b==0)
return 0;
if(b==1)
return a;

return a + func(a,b-1);
}

18.

What is the output of print(12)?

void print(int n)
{
if (n == 0)
return;
printf("%d", n%2);
print(n/2);
}

19.

What is the output of sum(8)?

int sum(int n)
{
if (n==0)
return n;
else
return n + sum(n-1);
}

20.

What is the output?

int rec(int num)
{
return (num) ? num%10 + rec(num/10):0;
}
void main()
{
printf("%d",rec(4567));
}

Showing 11 to 10 out of 20 Questions