Quiz for Recursion

Q1: What is recursion in C++?

A. A function calling itself B. A function calling another function C. A function returning a value D. A function with no parameters

Q2: Which of the following is a key part of a recursive function?

A. Base case B. Pointer argument C. Return type void D. Global variable

Q3: What happens if a recursive function does not have a base case?

A. Infinite recursion leading to stack overflow B. Program terminates normally C. Function never executes D. Compiler error

Q4: Which data structure is used to keep track of recursive calls?

A. Call stack B. Heap C. Queue D. Array

Q5: What is the result of a recursive function?

A. Depends on base case and recursive calls B. Always returns zero C. Always returns negative number D. Returns the address of the function

Q6: Which of the following is an example of recursion?

A. A factorial calculation function B. A simple addition function C. A function that prints Hello D. A function that reads input

Q7: What is tail recursion?

A. Recursive call is the last statement in the function B. Recursion that happens in loops C. Recursive call followed by arithmetic D. Recursion that returns void

Q8: Can recursion be replaced with iteration?

A. Yes, using loops B. No, recursion is unique C. Only for simple functions D. Only in C, not C++

Q9: What is a disadvantage of recursion?

A. Higher memory usage due to call stack B. Slower execution compared to iteration C. Risk of stack overflow D. All of the above

Q10: How does a recursive function return its final result?

A. By combining results from recursive calls B. By returning immediately C. By global variables D. By printing output

Q11: What is mutual recursion?

A. Two or more functions calling each other B. Function calling itself C. Function calling non-recursive function D. Function with default arguments

Q12: What must a recursive function do to ensure termination?

A. Reach the base case B. Call itself infinitely C. Use global variables D. Return void

Q13: Which of the following is NOT a good candidate for recursion?

A. Simple sequential loops B. Tree traversal C. Factorial calculation D. Fibonacci sequence

Q14: How does recursion affect program readability?

A. Can improve readability for complex problems B. Always reduces readability C. No effect on readability D. Makes code unreadable

Q15: What is the maximum depth of recursion limited by?

A. Stack size B. Heap size C. CPU speed D. Memory size

Q16: What is indirect recursion?

A. A function calling another function which calls the first function B. A function calling itself directly C. A function calling non-recursive functions D. A function with default arguments

Q17: Which is true about recursive functions?

A. They require more memory than equivalent loops B. They always run faster than loops C. They do not require base case D. They can only be used with integers

Q18: How to avoid stack overflow in recursion?

A. Ensure proper base case and limit recursion depth B. Use global variables C. Use inline functions D. Use void return type

Q19: Which function is an example of a recursive call?

A. void func() { func(); } B. void func() { return; } C. void func() { cout << "Hello"; } D. void func() { int a=5; }

Q20: In recursion, what is the "recursive case"?

A. The part where the function calls itself B. The part where the function returns C. The part where variables are declared D. The function header