Recursion in Python Quiz

What is recursion in Python?

• A way to create loops using for

• A function that returns a list

• A function that calls itself

• A function that runs forever

What is the main danger of recursion if not written properly?

• It prints the wrong result

• It runs only once

• It causes an infinite loop

• It turns into a list

Which part of a recursive function stops it from calling itself forever?

• Return statement

• Loop

• Base case

• Recursive call

What will this function return? def factorial(n): if n == 1: return 1 else: return n * factorial(n - 1) print(factorial(3))

• 3

• 6

• 9

• Error

What is the base case in this function? def countdown(n): if n == 0: print("Blast off!") else: print(n) countdown(n - 1)

• print(n)

• n == 0

• countdown(n - 1)

• "Blast off!"

What is printed when this code runs? def test(x): if x == 0: return print(x) test(x - 1) test(3)

• 3 2 1 0

• 0 1 2 3

• 3 2 1

• Nothing

Which of these problems is most suitable for recursion?

• Printing numbers from 1 to 10

• Finding maximum in a list

• Searching a file in nested folders

• Adding two numbers

Which line is the recursive call in this function? def greet(name, times): if times == 0: return print("Hello", name) greet(name, times - 1)

• return

• print("Hello", name)

• if times == 0:

• greet(name, times - 1)

What happens if there is no base case in a recursive function?

• It runs faster

• It prints nothing

• It calls itself forever and crashes

• It works like a loop

What does this function do? def sum_to_n(n): if n == 1: return 1 return n + sum_to_n(n - 1)

• Adds all numbers from 1 to n

• Multiplies all numbers from 1 to n

• Subtracts n from 1

• Prints all even numbers