Virtual Labs

1. What is recursion in computer programming?

c: A function calling itself Explanation

Explanation

a: A function calling another function Explanation

Explanation

d: A loop inside a function Explanation

Explanation

b: A function with no return value Explanation

Explanation

2. Which of the following is essential for a recursive function to work correctly?

d: A base case Explanation

Explanation

b: A loop Explanation

Explanation

a: A global variable Explanation

Explanation

c: A print statement Explanation

Explanation

3. What will happen if a recursive function does not have a base case?

b: It will run infinitely or cause a stack overflow Explanation

Explanation

d: It will return 0 Explanation

Explanation

a: It will print nothing Explanation

Explanation

c: It will run faster Explanation

Explanation

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

c: Calculating factorial of a number Explanation

Explanation

a: Printing Hello World Explanation

Explanation

d: Adding two numbers Explanation

Explanation

b: Assigning a value to a variable Explanation

Explanation

5. What is the base case in the recursive computation of factorial(n)?

b: n == 0 Explanation

Explanation

a: n == 1 Explanation

Explanation

d: n < 0 Explanation

Explanation

c: n > 1 Explanation

Explanation

6. Which of the following best describes the call stack in recursion?

d: A structure that keeps track of active function calls Explanation

Explanation

c: A list of variables Explanation

Explanation

a: A type of loop Explanation

Explanation

b: A sorting algorithm Explanation

Explanation

7. Which of the following is a disadvantage of recursion?

b: It can use more memory due to the call stack Explanation

Explanation

a: It always runs faster than iteration Explanation

Explanation

d: It cannot solve any problems Explanation

Explanation

c: It is never used in practice Explanation

Explanation

8. Which of the following is an example of a divide-and-conquer algorithm that uses recursion?

a: Bubble Sort Explanation

Explanation

b: Assignment Explanation

Explanation

c: Merge Sort Explanation

Explanation

d: Linear Search Explanation

Explanation

9. What is tail recursion?

a: A recursive call inside a loop Explanation

Explanation

b: A recursive call with multiple parameters Explanation

Explanation

c: A recursive call with no base case Explanation

Explanation

d: A recursive call that is the last operation in the function Explanation

Explanation

10. Which of the following problems can be solved using recursion?

a: Balancing weights on a scale Explanation

Explanation

b: Tower of Hanoi Explanation

Explanation

c: All of the above Explanation

Explanation

d: Fibonacci sequence Explanation

Explanation

Recursion