Question 1

What is the base case in a recursive function?

Accepted Answer

A condition that stops the recursion

Answer

The input parameters of the function

Answer

The return value of the function

Answer

The total number of function calls

Question 2

In a recursive function to calculate the factorial of a number

n

, what would be the recursive call be?

Accepted Answer

factorial(n - 1)

Answer

factorial(n / 2)

Answer

factorial(n + 1)

Answer

factorial(n) * n

Question 3

Which of the following statements is true regarding recursion?

Accepted Answer

Recursion can lead to stack overflow if not properly managed

Answer

All recursive functions have a maximum depth of 10

Answer

Recursion is always more efficient than iteration

Answer

Recursive functions cannot return a value

Question 4

What is a common application of recursion in programming?

Accepted Answer

Solving problems like tree traversal

Answer

Performing linear search

Answer

Sorting an array using bubble sort

Answer

Executing an iterative loop

Question 5

What is the main advantage of using recursion?

Accepted Answer

It simplifies code by reducing the need for explicit loops

Answer

It uses less memory than iterative solutions

Answer

It avoids the need for any base cases

Answer

It always executes faster than loops

Question 6

In the context of recursion, what does the term 'depth' refer to?

Accepted Answer

The number of recursive calls made before reaching the base case

Answer

The maximum size of the function's input

Answer

The time complexity of the recursive algorithm

Answer

The total number of parameters in a function

Question 7

What is the role of a base case in a recursive function?

Accepted Answer

It defines when the recursion should stop

Answer

It increases the efficiency of the function

Answer

It collects all the recursive results

Answer

It automatically handles all edge cases

Question 8

Which of the following statements about recursion is true?

Accepted Answer

Recursion can simplify code by eliminating loops

Answer

Recursion always uses less memory than iteration

Answer

All recursive functions must have multiple base cases

Answer

Recursive functions cannot be optimized

Question 9

What is the primary purpose of the recursive call in a recursive function?

Accepted Answer

To break the problem down into smaller subproblems

Answer

To iterate over a data structure

Answer

To directly solve the problem without any conditions

Answer

To create an infinite loop

Question 10

Which of the following is a characteristic feature of a recursive algorithm?

Accepted Answer

It calls itself with modified parameters

Answer

It only uses global variables

Answer

It cannot return values

Answer

It operates using a single loop

Question 11

What is a common problem that can arise with poorly designed recursive functions?

Accepted Answer

Infinite recursion leading to a stack overflow

Answer

Excessive use of memory without recursion

Answer

Immediate termination without output

Answer

Constant time execution

Question 12

Which of the following correctly describes a recursive function's structure?

Accepted Answer

It must include a base case and a recursive case

Answer

It can only call itself once per invocation

Answer

It must use a loop to iterate

Answer

It should not return a value

Related quizzes

Related quizzes