For a recursive algorithm : – McqOptions

MCQOPTIONS

1.	For a recursive algorithm :
A.	a base case is necessary and is solved without recursion.
B.	a base case is not necessary
C.	doesnot solve a base case directly
D.	none of the mentioned
Answer» C. doesnot solve a base case directly

Discussion

No Comment Found

Related MCQs

There are two algorithms suppose A takes 1.41 milli seconds while B takes 0.9 milliseconds, which one of them is better considering all other things the same?
An algorithm: can be represented through _________
For an algorithm which is the most important characteristic that makes it acceptable _________
Optimization of algorithm means _________
For a recursive algorithm _________
An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________
A Complexity of algorithm depends upon _________
An algorithm which uses the past results and uses them to find the new results is _________
An algorithm in which we divide the problem into subproblem and then we combine the subsolutions to form solution to the original problem is known as _________
An Algorithm is ___________