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 is 2. This is because the isEven function calls the isOdd function, and the isOdd function calls the isEven function.

Consider the Following Code Snippet: Public Static Boolean IsEven(int N)