Recursion in Programming Principles: A Comprehensive Guide for Beginners

Question 1

Define recursion.

Accepted Answer

A function that directly or indirectly calls itself.

Answer

A function that iterates through a loop.

Answer

A function that modifies its own code.

Answer

A function that returns a value based on its input parameters.

Question 2

Which of the following is an advantage of using recursion?

Accepted Answer

Simplified code.

Answer

Improved performance.

Answer

Reduced memory usage.

Answer

Increased execution speed.

Question 3

What is a potential risk associated with recursion?

Accepted Answer

Stack overflow.

Answer

Infinite loops.

Answer

Compilation errors.

Answer

Runtime errors.

Question 4

Describe a technique to prevent stack overflow in recursion.

Accepted Answer

Using a tail-recursive approach.

Answer

Using a loop instead of recursion.

Answer

Increasing the stack size.

Answer

Reducing the number of recursive calls.

Question 5

Is it possible to use recursion to solve any computational problem?

Accepted Answer

No.

Answer

Yes.

Question 6

Which of the following is a disadvantage of recursion compared to iteration?

Accepted Answer

Requires more memory

Answer

Is more efficient

Answer

Is easier to implement

Question 7

The defining characteristic of a recursive function is that it:

Accepted Answer

Repeats by calling itself multiple times.

Answer

Consistently returns a value.

Answer

Can only solve trivial problems.

Answer

Always guarantees a solution.

Question 8

In a recursive function, the base case represents:

Accepted Answer

The smallest problem size that halts recursive calls.

Answer

The largest problem size that can be handled.

Answer

The initial call that triggers recursion.

Answer

The final call that produces the result.

Question 9

In the following recursive function, which condition represents the base case?
def factorial(n):
  if n == 0:
    return 1
  else:
    return n * factorial(n-1)

Accepted Answer

n == 0

Answer

n == 1

Answer

n > 0

Answer

n < 0

Question 10

In recursion, a stack frame is primarily used to:

Accepted Answer

Keep track of recursive calls.

Answer

Store function parameters.

Answer

Store local variables.

Answer

Store return values.

Question 11

Which of the following is NOT a benefit of recursion?

Accepted Answer

Reduces memory usage

Answer

Simplifies complex problems

Answer

Improves code readability

Answer

Eliminates the need for loops

Question 12

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

Accepted Answer

To stop the recursive calls

Answer

To initialize the function parameters

Answer

To check for errors

Answer

To calculate the final result

Question 13

Which of the following is a classic example of a recursive problem?

Accepted Answer

Finding the factorial of a number

Answer

Reversing a string

Answer

Searching for an element in an array

Answer

Sorting a list of numbers

Question 14

What is the main concern when designing a recursive function?

Accepted Answer

Stack overflow

Answer

Code efficiency

Answer

Data accuracy

Answer

User interface

Question 15

What is the difference between a direct and an indirect recursive call?

Accepted Answer

Direct calls the function itself, indirect calls another function that calls it

Answer

Indirect calls the function itself, direct calls another function that calls it

Answer

There is no difference between direct and indirect recursive calls

Answer

Direct calls the function once, indirect calls it multiple times

Question 16

Consider the following code: `def factorial(n): if n == 0: return 1 else: return n * factorial(n-1)`. What is the base case in this function?

Accepted Answer

if n == 0

Answer

return 1

Answer

return n * factorial(n-1)

Answer

else:

Question 17

Identify the disadvantage of using recursion:

Accepted Answer

Potential stack overflow if the recursive calls are excessive

Answer

Efficient memory utilization

Answer

Enhanced clarity of code

Answer

Simplified problem-solving

Question 18

In the recursive function below, what signifies the base case? def factorial(n): if n <= 1: return 1 else: return n * factorial(n - 1)

Accepted Answer

n <= 1

Answer

n > 1

Answer

n != 1

Answer

n == 1

Question 19

What is the primary purpose of recursion?

Accepted Answer

To decompose a problem into smaller, similar subproblems

Answer

To facilitate user interaction

Answer

To iterate through data structures

Question 20

Identify the recursive approach for calculating a number's factorial:

Accepted Answer

def factorial(n): if n == 0: return 1 else: return n * factorial(n - 1)

Answer

for i in range(n): factorial *= i

Answer

while n != 1: n *= (n - 1)

Question 21

Determine the time complexity of the following recursive function: def fibonacci(n): if n == 0 or n == 1: return 1 else: return fibonacci(n - 1) + fibonacci(n - 2)

Accepted Answer

Exponential (2^n)

Answer

Logarithmic (log n)

Answer

Quadratic (n^2)

Answer

Linear (n)

Question 22

Which traversal strategy involves recursively exploring a binary tree in depth:

Accepted Answer

Depth-first search (DFS)

Answer

Selection sort

Answer

Breadth-first search (BFS)

Answer

Bubble sort

Question 23

Explain the distinction between direct and indirect recursion:

Accepted Answer

Direct recursion calls itself explicitly, while indirect recursion involves calling another function that in turn calls the original function

Answer

Direct recursion is used for iteration, while indirect recursion is used for backtracking

Question 24

Identify the characteristic of tail recursion:

Accepted Answer

The recursive call is the last action performed in the function

Answer

Tail recursion is less efficient than head recursion

Answer

Tail recursion requires a trampoline function to execute correctly

Question 25

What is the role of a trampoline function in recursion?

Accepted Answer

To transform tail-recursive functions into iterative code, optimizing performance

Answer

To handle exceptions during recursive calls

Answer

To store intermediate results of recursive computations