Multiple Choice
Which of the following statements describe the base case of a recursive algorithm?
(i) F(0) = 0;
(ii) F(x) = 2 * F(x - 1) ;
(iii) if (x == 0)
F(x) = 5 + x;
A) Only (i)
B) Only (ii)
C) Only (iii)
D) Both (i) and (iii)
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q10: A program will terminate after completing any
Q16: You can think of a recursive method
Q17: The base case starts the recursion.
Q23: Every recursive call has its own code.
Q26: The following is an example of a
Q27: public static int func2(int m, int n)<br>{<br>If
Q35: public static int exampleRecursion (int n)<br>{<br>If (n
Q36: public static int exampleRecursion (int n)<br>{<br>If (n
Q37: Assume there are four methods A, B,
Q42: A method that calls another method and