Virtual Labs

1. Which of the following best describes a base case in recursion?

a: A function that calls itself Explanation

Explanation

b: A variable declaration Explanation

Explanation

c: A condition where recursion stops Explanation

Explanation

d: A loop inside a function Explanation

Explanation

2. What is the output of the following recursive function call: factorial(3)? function factorial(n) { if (n == 0) return 1; else return n * factorial(n-1); }

a: 0 Explanation

Explanation

b: 1 Explanation

Explanation

c: 3 Explanation

Explanation

d: 6 Explanation

Explanation

3. Which of the following is NOT a property of recursion?

a: Always faster than iteration Explanation

Explanation

b: Requires a base case Explanation

Explanation

c: Can be used to solve combinatorial problems Explanation

Explanation

d: Can lead to stack overflow Explanation

Explanation

4. In the context of recursion, what is a call stack overflow?

a: When a function returns a value Explanation

Explanation

b: When a loop runs infinitely Explanation

Explanation

c: When too many recursive calls exhaust the stack memory Explanation

Explanation

d: When a variable is not initialized Explanation

Explanation

5. Which of the following problems is best solved using recursion?

a: Variable assignment Explanation

Explanation

b: Simple addition Explanation

Explanation

c: Finding the maximum in an array Explanation

Explanation

d: Tower of Hanoi Explanation

Explanation

6. What is the main advantage of tail recursion?

a: It always runs faster Explanation

Explanation

b: It can be optimized to use less stack space Explanation

Explanation

c: It requires no base case Explanation

Explanation

d: It never terminates Explanation

Explanation

7. Which of the following recursive algorithms is used to solve the balancing weights problem?

a: Sorting the weights Explanation

Explanation

b: Ignoring the weights Explanation

Explanation

c: Exploring all combinations of placing weights Explanation

Explanation

d: Adding all weights to one side Explanation

Explanation

8. Which of the following is true about the subset sum problem in recursion?

a: It only works for two weights Explanation

Explanation

b: It is not related to recursion Explanation

Explanation

c: It cannot be solved recursively Explanation

Explanation

d: It can be solved by considering all combinations recursively Explanation

Explanation

9. What is the main risk of using recursion without careful design?

a: All of the above Explanation

Explanation

b: Stack overflow Explanation

Explanation

c: Incorrect results Explanation

Explanation

d: Infinite loops Explanation

Explanation

10. Which of the following is NOT a typical use case for recursion?

a: Simple variable assignment Explanation

Explanation

b: Sorting algorithms like Merge Sort Explanation

Explanation

c: Solving combinatorial problems Explanation

Explanation

d: Tree traversal Explanation

Explanation

Recursion