Consider the following code snippet:
Public static boolean isEven(int n)
{
If (n % 2 == 0)
{
Return true;
}
Else
{
Return (isOdd(n));
}
}
Public static boolean isOdd(int n)
{
If (n % 2 == 1)
{
Return true;
}
Else
{
Return (isEven(n));
}
}
For any given value of n, what is the maximum number of function calls that could occur?
A) 0
B) 1
C) 2
D) cannot be determined

Question

Quizplus · Accepted Answer

The maximum number of function calls that could occur for any given value of n is 2, because each function calls the other once at most. If n is even, the isEven function is called once and returns true. If n is odd, the isOdd function is called once, which calls the isEven function once and returns true. Therefore, the maximum number of function calls that could occur is 2.

Consider the Following Code Snippet