Virtual Labs

Recursion

1. What is recursion in computer science?

a: A programming error Explanation

Explanation

b: A loop construct Explanation

Explanation

c: A function calling itself Explanation

Explanation

d: A data structure Explanation

Explanation

2. What is the purpose of a base case in a recursive function?

a: To provide a starting point for the recursive calls Explanation

Explanation

b: To handle the edge cases Explanation

Explanation

c: To optimize the function for better performance Explanation

Explanation

d: To make the function more readable Explanation

Explanation

3. What is the main difference between recursive and iterative solutions?

a: Recursive solutions use loops, while iterative solutions use function calls Explanation

Explanation

b: Recursive solutions use function calls, while iterative solutions use loops Explanation

Explanation

c: Recursive solutions are faster, while iterative solutions are slower Explanation

Explanation

d: Recursive solutions are less efficient, while iterative solutions are more efficient Explanation

Explanation

4. For every recursive solution, there is a corresponding iterative solution?

a: True Explanation

Explanation

b: False Explanation

Explanation

5. What is the advantage of using recursion over iteration?

a: Recursion is generally faster than iteration Explanation

Explanation

b: Recursion is easier to understand and implement than iteration Explanation

Explanation

c: Recursion uses less memory than iteration Explanation

Explanation

d: Recursion is more flexible than iteration Explanation

Explanation

6. Which of the following is NOT a characteristic of recursion?

a: A function calling itself repeatedly Explanation

Explanation

b: A function solving a problem by breaking it down into smaller sub-problems Explanation

Explanation

c: A function having a fixed number of iterations Explanation

Explanation

d: A function with a terminating condition Explanation

Explanation

7. In a recursive function, what happens when the base case is not reached?

a: The function will continue to call itself infinitely Explanation

Explanation

b: The function will throw an error Explanation

Explanation

c: The function will return a default value Explanation

Explanation

d: The function will terminate immediately Explanation

Explanation

8. How can we avoid a stack overflow error in a recursive function?

a: By ensuring that the function has a base case Explanation

Explanation

b: By limiting the number of recursive calls Explanation

Explanation

c: By using iteration instead of recursion Explanation

Explanation

d: By increasing the size of the stack Explanation

Explanation

9. Can recursion be used to solve dynamic programming problems?

a: Yes, recursion is well suited for dynamic programming problems Explanation

Explanation

b: No, recursion is not suitable for dynamic programming problems Explanation

Explanation

c: Sometimes, depending on the specific problem Explanation

Explanation

d: Only if the problem has a small number of inputs Explanation

Explanation

10. How do we determine the optimal depth of recursion in a recursive function?

a: By trial and error Explanation

Explanation

b: By analyzing the time complexity of the function Explanation

Explanation

c: By looking at the base case Explanation

Explanation

d: By checking the documentation Explanation

Explanation

11. Can recursion be used to solve problems with multiple correct solutions?

a: Yes, recursion can be used to find all possible solutions Explanation

Explanation

b: No, recursion can only find one solution Explanation

Explanation

c: Sometimes, depending on the specific problem Explanation

Explanation

d: Only if the problem has a unique solution Explanation

Explanation

12. What is the main advantage of using recursion over iteration in some cases?

a: Recursion is always faster Explanation

Explanation

b: Recursion uses less memory Explanation

Explanation

c: Recursion can solve problems that are hard to express iteratively Explanation

Explanation

d: Recursion is easier to implement Explanation

Explanation

13. What is the purpose of a recursive function's 'stack'?

a: To store local variables Explanation

Explanation

b: To keep track of function calls Explanation

Explanation

c: To store global variables Explanation

Explanation

d: To hold the return value Explanation

Explanation

14. Recursion can be a powerful tool in algorithm design. When would you choose to implement an iterative solution instead of a recursive one?

a: When the problem can be naturally defined in a recursive manner. Explanation

Explanation

b: When memory usage is a critical concern, and a non-recursive solution would use less memory. Explanation

Explanation

c: When the problem involves complex data structures, making recursion the preferred choice. Explanation

Explanation

d: When you want to simplify the code and make it more intuitive. Explanation

Explanation

15. In recursive algorithms, what is meant by 'tail recursion'?

a: A type of recursion that is slower than regular recursion Explanation

Explanation

b: A recursive call that appears at the end of a function and doesn't require any further computation after the recursive call returns Explanation

Explanation

c: A recursive call that occurs within a loop Explanation

Explanation

d: A type of recursion that uses a tail data structure Explanation

Explanation

16. How can you optimize a recursive function to reduce the overhead of function calls?

a: By making the recursive calls non-tail recursive Explanation

Explanation

b: By using global variables instead of local variables Explanation

Explanation

c: By using memoization or dynamic programming techniques Explanation

Explanation

d: By removing the base case Explanation

Explanation

17. What is the time complexity of a recursive function that makes n recursive call, assuming each recursive call takes O(1) time?

a: O(2^n) Explanation

Explanation

b: O(log n) Explanation

Explanation

c: O(n^2) Explanation

Explanation

d: O(n) Explanation

Explanation

18. What is the concept of 'tree recursion'?

a: A recursion that models a tree structure with multiple branches Explanation

Explanation

b: A recursion that only works with binary trees Explanation

Explanation

c: A recursion that creates a tree-like data structure Explanation

Explanation

d: A recursion that uses a stack data structure Explanation

Explanation

19. In the context of recursion, what is 'tail call optimization,' and why is it important?

a: Tail call optimization is a method for making recursive functions easier to understand, but it doesn't have any impact on performance. Explanation

Explanation

b: Tail call optimization is a term used in functional programming, and it doesn't apply to recursion in imperative languages. Explanation

Explanation

c: Tail call optimization is a way to convert recursive functions into iterative functions, making them more efficient. Explanation

Explanation

d: Tail call optimization is a technique to make recursive calls more efficient, and it is important because it reduces the risk of stack overflow errors. Explanation

Explanation

20. Explain the concept of 'mutual recursion' in programming and provide an example scenario where it might be applied.

a: Mutual recursion is when two recursive functions call each other, and it is commonly used in algorithms for sorting and searching. Explanation

Explanation

b: Mutual recursion is when a recursive function calls itself multiple times within a single iteration, optimizing performance. Explanation

Explanation

c: Mutual recursion is a technique to replace recursion with iteration for better efficiency. Explanation

Explanation

d: Mutual recursion is an outdated concept and is no longer relevant in modern programming. Explanation

Explanation