19.2 Recursion Cambridge iA 9618

What is recursion?

• A function calling itself

• A function that never returns

• A function without parameters

• A function that executes a loop

What is the base case in recursion?

• A condition that stops further recursive calls

• A condition that ensures infinite recursion

• The first function call in recursion

• A case where the function calls itself multiple times

Which data structure does recursion primarily use?

• Stack

• Queue

• Heap

• Array

Which of the following is NOT a key property of recursion?

• Base case

• Recursive case

• Function calling itself

• Function never terminating

What happens if the base case is missing in a recursive function?

• The program crashes due to a stack overflow

• The function stops executing immediately

• The compiler automatically fixes the problem

• The recursion converts to an iterative loop

Which of these problems is best solved using recursion?

• Calculating Fibonacci numbers

• Searching for an element in an unsorted array

• Adding numbers in a list using a loop

• Swapping two numbers in memory

Which sorting algorithm is often implemented using recursion?

• Merge Sort

• Bubble Sort

• Selection Sort

• Bucket Sort

Which algorithm is used for finding the shortest path and is based on recursion?

• Depth-first search (DFS)

• Breadth-first search (BFS)

• Linear search

• Hashing

Which problem is NOT typically solved using recursion?

• Tree Traversal

• Factorial Calculation

• Finding the maximum element in an unsorted array

• Tower of Hanoi

Which of these is an example of indirect recursion?

• Function A calls Function B, which calls Function A

• A function calls itself directly

• A function uses a loop instead of recursion

• A function does not have a base case