Which problem can occur when recursion has no reachable base case?

Options

  • A. The function always returns zero
  • B. The program may exhaust its call stack
  • C. The compiler automatically converts every recursive function to a loop
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. The program may exhaust its call stack

Detailed Explanation

Correct Answer: Option B

Explanation:
Each recursive call generally requires another function-call frame. If recursion continues without termination, the call stack may be exhausted, often causing a stack overflow. A compiler does not guarantee that recursion will be converted to a loop.
← Previous Next →

Attempt Quiz Now:

TRE4 C and C++ Quiz practice set 3

Feature Posts