Mutual Recursion Examples in Java for AP Computer Science A Students

📚 Quick Study Guide

• 🔄 Mutual recursion occurs when two or more methods call each other.
• 🧱 Each method must have a base case to prevent infinite recursion.
• ❗ Ensure that the input is modified in each recursive call to move towards the base case.
• 💡 Common examples involve alternating sequences or complex decision trees.
• 💻 Understanding call stacks is crucial for debugging mutual recursion.

Practice Quiz

1. Which of the following best describes mutual recursion?
   1. A) A method that calls itself.
   2. B) Two or more methods calling each other.
   3. C) A method that calls another method which then calls a third method.
   4. D) A method that does not have a base case.
2. What is the most important requirement to avoid a stack overflow error in mutual recursion?
   1. A) Using global variables.
   2. B) Having a clearly defined base case in each method.
   3. C) Using a large amount of memory.
   4. D) Avoiding parameters.
3. Consider two mutually recursive methods, `methodA()` and `methodB()`. If `methodA()` calls `methodB()`, what must `methodB()` eventually do to ensure the recursion terminates?
   1. A) Call another method.
   2. B) Call `methodA()` again.
   3. C) Reach a base case and return.
   4. D) Throw an exception.
4. Which of the following is a typical use case for mutual recursion?
   1. A) Calculating factorials.
   2. B) Traversing a singly linked list.
   3. C) Parsing nested structures like XML or JSON.
   4. D) Sorting an array.
5. What happens if mutually recursive methods do not have a proper base case?
   1. A) The program runs indefinitely.
   2. B) The program terminates normally.
   3. C) A stack overflow error occurs.
   4. D) The program prints an error message and continues.
6. In mutual recursion, what is the role of the call stack?
   1. A) To store global variables.
   2. B) To keep track of the sequence of method calls.
   3. C) To manage memory allocation.
   4. D) To handle exceptions.
7. Given two mutually recursive functions `isEven(n)` and `isOdd(n)`, which statement is generally true?
   1. A) `isEven(n)` calls `isEven(n-2)` and `isOdd(n)` calls `isOdd(n-2)`.
   2. B) `isEven(n)` calls `isOdd(n-1)` and `isOdd(n)` calls `isEven(n-1)`.
   3. C) `isEven(n)` calls `isOdd(n)` and `isOdd(n)` calls itself.
   4. D) `isEven(n)` and `isOdd(n)` both call the same helper function.