Quiz on Python Recursion Function

What is recursion in Python?

What is essential for a recursive function to avoid infinite calls?

What will happen if a recursive function has no base case?

What is the output of this recursive function?

def recur(n):
if n == 0:
return 1
return n * recur(n-1)
print(recur(3))

What is the default recursion limit in Python?

Which module allows changing the recursion limit?

What does the following return?

Which of the following problems is best solved using recursion?

What does this recursive function do?

def mystery(n):
if n == 0: return
mystery(n-1)
print(n)

What is a base case?

How does tail recursion differ from standard recursion?

What’s the drawback of using recursion for Fibonacci without memoization?

Which function is used to handle recursion optimization in Python?

Is it possible to write any recursive function as an iterative one?

What’s the key advantage of recursion?