Quiz for Recursion

Q1: What is recursion in C?

A. A function calling itself directly or indirectly B. A function calling another function C. A loop calling a function D. A function without return type

Q2: Which of the following is required for recursion to work correctly?

A. A base case B. An infinite loop C. Multiple functions D. A void return type

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

A. It will terminate normally B. It will cause a stack overflow C. It will skip execution D. It will run once only

Q4: Which of these is an example of direct recursion?

A. A calls A B. A calls B and B calls C C. A calls B and B calls A D. A calls C indirectly

Q5: Which is an example of indirect recursion?

A. A calls A B. A calls B and B calls A C. A calls B and C calls A D. A calls C and D calls B

Q6: In recursion, each function call is stored in which memory area?

A. Stack B. Heap C. Queue D. Global memory

Q7: Which problem is best solved using recursion?

A. Calculating factorial B. Printing a message once C. Reading a file line by line D. Assigning values to variables

Q8: Which of the following is NOT a drawback of recursion?

A. More memory usage B. Slower execution C. Code simplicity D. Stack overflow risk

Q9: What is tail recursion?

A. When the recursive call is the last statement in the function B. When recursion happens in the middle C. When recursion has no base case D. When recursion occurs only once

Q10: Which function is an example of tail recursion?

A. A factorial function where recursive call is last statement B. A Fibonacci function C. A tree traversal function D. A function with multiple return statements

Q11: Recursion can be replaced by which iterative method?

A. Loops B. Arrays C. Pointers D. Structures

Q12: Which is more memory efficient, recursion or iteration?

A. Iteration B. Recursion C. Both are same D. Depends on compiler

Q13: What is the main difference between recursion and iteration?

A. Recursion uses function calls, iteration uses loops B. Iteration is faster C. Recursion is always better D. Iteration cannot repeat tasks

Q14: Which is a common use of recursion in data structures?

A. Linked list traversal B. Array initialization C. Variable declaration D. Switch statement execution

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

A. Stack size B. Heap size C. Number of variables D. CPU speed

Q16: Which keyword is used to return from a recursive function?

A. return B. break C. continue D. exit

Q17: Which of these algorithms is naturally recursive?

A. QuickSort B. BubbleSort C. InsertionSort D. SelectionSort

Q18: What happens in each recursive call?

A. A new copy of variables is created B. Same variables are reused C. Variables are overwritten D. Memory is freed

Q19: Recursion is generally less efficient than iteration because:

A. It uses more memory and function call overhead B. It has fewer lines of code C. It is harder to debug D. It runs only once

Q20: Which type of problems are NOT suited for recursion?

A. Problems with small, repetitive tasks B. Problems with deep call chains C. Problems involving tree traversal D. Problems involving factorial calculation