Multiple Choice Questions on Recursion in Java

📚 Quick Study Guide

• 🔄 Definition: Recursion is a programming technique where a function calls itself directly or indirectly to solve a smaller subproblem of the same type.
• 🧱 Base Case: Every recursive function must have a base case, which is a condition that stops the recursion and prevents infinite loops.
• 🧮 Recursive Step: The recursive step is where the function calls itself with a modified input, working towards the base case.
• ⚠️ Stack Overflow: If the base case is not reached or is defined incorrectly, recursion can lead to a stack overflow error due to excessive function calls.
• 🔑 Key Principles:
  • Divide the problem into smaller, similar subproblems.
  • Solve the smaller subproblems using recursive calls.
  • Combine the solutions of the subproblems to solve the original problem.
• 💡 When to use Recursion: Recursion is often used when dealing with data structures like trees and graphs, or for problems that can be naturally broken down into smaller, self-similar instances.
• ⏱️ Performance Considerations: While elegant, recursion can sometimes be less efficient than iterative solutions due to the overhead of function calls. Tail recursion optimization (not always available in Java) can help mitigate this.

🧪 Practice Quiz

1. Which of the following is the most important part of a recursive function?
   1. It must call another function.
   2. It must have a return type of void.
   3. It must have a base case.
   4. It must use a loop.
2. What happens if a recursive function does not have a base case?
   1. The program will compile with a warning.
   2. The function will execute only once.
   3. The program will enter an infinite loop, potentially leading to a stack overflow.
   4. The program will terminate immediately.
3. Which of the following problems is best solved using recursion?
   1. Calculating the average of numbers in an array.
   2. Finding the largest element in an array.
   3. Calculating the factorial of a number.
   4. Printing all elements of an array.
4. What is a "stack overflow" error in the context of recursion?
   1. It is an error that occurs when a function tries to access memory outside of its allocated stack frame.
   2. It is an error that occurs when a recursive function calls itself too many times, exceeding the stack limit.
   3. It is an error that occurs when there is not enough memory to store the return value of a function.
   4. It is an error related to heap memory allocation.
5. What is tail recursion?
   1. A type of recursion that always returns 0.
   2. A type of recursion that involves calling itself at the end of the function.
   3. A type of recursion that only works with arrays.
   4. A type of recursion that is always less efficient than iteration.
6. Consider the following recursive function:

   
   int mystery(int n) {
       if (n == 0) {
           return 0;
       } else {
           return n + mystery(n - 1);
       }
   }
   

   What will `mystery(3)` return?
   1. 0
   2. 3
   3. 6
   4. 10
7. Which of the following is NOT a characteristic of recursion?
   1. It involves a base case.
   2. It involves calling the function itself.
   3. It always uses less memory than iterative solutions.
   4. It breaks a problem into smaller, similar subproblems.