#1
What is recursion in computer science?
A function that calls itself
ExplanationRecursion involves a function calling itself, allowing tasks to be solved through smaller instances of the same problem.
#2
Which of the following is a base case in recursive functions?
The case where the function returns a value without making any further recursive calls
ExplanationBase case serves as the stopping condition for recursion, preventing infinite looping.
#3
What is the base case in recursion?
The case where the function stops calling itself
ExplanationBase case defines when the recursion should stop, preventing infinite loops.
#4
What happens if the base case is not defined properly in a recursive function?
The function will enter an infinite loop
ExplanationWithout a proper base case, the recursive function will keep calling itself endlessly.
#5
What is the time complexity of the Fibonacci sequence algorithm implemented using recursion?
O(2^n)
ExplanationExponential time complexity due to repeated redundant calculations.
#6
What is tail recursion?
A recursion method where the recursive call is the last thing executed by the function
ExplanationTail recursion optimizes space usage by allowing recursive calls to replace the current function's stack frame.
#7
Which of the following is NOT a valid example of recursion?
Bubble sort
ExplanationBubble sort is an iterative sorting algorithm, not based on recursion.
#8
What is memoization in the context of recursion?
A technique to optimize recursive algorithms by storing previously computed results
ExplanationMemoization reduces redundant calculations by storing and reusing intermediate results.
#9
What is the main drawback of using recursion?
Recursion is inefficient in terms of memory usage
ExplanationRecursion often consumes more memory as each function call requires additional stack space.
#10
In recursion, what is meant by the 'call stack'?
A data structure that stores function calls
ExplanationCall stack manages the sequence of function calls and their contexts during recursion.
#11
What is a common example of tail recursion optimization?
Converting the recursive function into an iterative one
ExplanationTail recursion optimization transforms recursive functions into equivalent iterative ones, saving stack space.