Which of the following algorithm cannot be designed without recursion – McqOptions

MCQOPTIONS

1.	Which of the following algorithm cannot be designed without recursion
A.	Tower of Hanoi
B.	Fibonacci Series
C.	Tree Traversal
D.	None of the above
Answer» E.

Discussion

No Comment Found

Related MCQs

What s happen if base condition is not defined in recursion ?
Which of the following algorithm cannot be designed without recursion
Infinite recursion leads to
What does the following function print for n = 25?void fun(int n){ if (n == 0) return; printf( %d , n%2); fun(n/2);}
Predict output of following programConsider the following recursive function fun(x, y). What is the value of fun(4, 3)int fun(int x, int y) { if (x == 0) return y; return fun(x 1, x + y);}
What is the base case for the following code?
If there is no base criteria in a recursive program, the program will .