Virtual Labs

In recursion, the condition for which the function will stop calling itself is ____________

a: Base case Explanation

Explanation

b: Worst case Explanation

Explanation

c: Best case Explanation

Explanation

d: None of the above Explanation

Explanation

Recursion is a method in which the solution of a problem depends on ____________

a: Larger instances of different problems Explanation

Explanation

b: Larger instances of the same problem Explanation

Explanation

c: Smaller instances of the same problem Explanation

Explanation

d: Smaller instances of different problems Explanation

Explanation

Recursion is similar to which of the following?

a: Switch Case Explanation

Explanation

b: Loop Explanation

Explanation

c: If-else Explanation

Explanation

d: if elif else Explanation

Explanation

A recursive function without if and else conditions will always lead to?

a: Finite loop Explanation

Explanation

b: Infinite loop Explanation

Explanation

c: Incorrect result Explanation

Explanation

d: Correct result Explanation

Explanation

Which of the following is true?

a: Recursion is always better than iteration Explanation

Explanation

b: Recursion uses more memory compared to iteration Explanation

Explanation

c: Recursion uses less memory compared to iteration Explanation

Explanation

d: Iteration is always better and simpler than recursion Explanation

Explanation

What happens to the function calls in recursion during execution?

a: Stored in Queue Explanation

Explanation

b: Stored in Stack Explanation

Explanation

c: Stored in Heap Explanation

Explanation

d: Stored in Cache Explanation

Explanation

What is tail recursion optimization?

a: A technique to reduce the space complexity of recursive calls Explanation

Explanation

b: A way to convert recursion to iteration Explanation

Explanation

c: A compiler optimization that eliminates stack frames for recursive calls in tail position Explanation

Explanation

d: A method to reduce the time complexity of recursive algorithms Explanation

Explanation

In the context of recursive algorithms, what is 'memoization'?

a: A technique to store previously calculated results to avoid redundant computations Explanation

Explanation

b: A method to reduce the stack space used by recursion Explanation

Explanation

c: A way to convert recursive algorithms to iterative ones Explanation

Explanation

d: A technique to optimize tail recursion Explanation

Explanation

Which of the following problems is best solved using recursion?

a: Finding the maximum element in an array Explanation

Explanation

b: Traversing a binary tree in any order Explanation

Explanation

c: Computing the sum of numbers from 1 to n Explanation

Explanation

d: Sorting an array using bubble sort Explanation

Explanation