Quiz on Recursive Functions

What is a recursive function?

• A function that returns a value

• A function that loops through an array

• A function that calls itself

• A function that calls another function

What is the base case in recursion?

• The main function

• The last call of the function

• The first call of the function

• The condition that stops the recursion

Which of the following is an example of a problem that can be solved using recursion?

• Searching for an element in a list

• Sorting an array

• Calculating the factorial of a number

• Finding the maximum number in an array

What is the time complexity of the recursive Fibonacci function?

• O(log n)

• O(n)

• O(n^2)

• O(2^n)

What is the main advantage of using recursion over loops?

• Recursion uses less memory

• Recursion is easier to understand

• Recursion can simplify code for complex problems

• Recursion is always faster

In the context of recursion, what does 'tail recursion' mean?

• The function does not call itself

• The recursive call is the first operation in the function

• The recursive call is the last operation in the function

• The function calls another function

Which of the following is NOT a use case for recursion?

• Finding the minimum value in an array

• Tower of Hanoi

• N Queens Problem

• Binary search

What happens if a recursive function does not have a base case?

• It will run indefinitely without errors

• It will cause a stack overflow

• It will return a value

• It will execute only once

What is the output of the function countDown(4)?

• 4 3 2 1 0

• 4 3 2 1

• 1 2 3 4

• 0 1 2 3 4

Which of the following describes 'head recursion'?

• The function calls itself multiple times

• The function does not call itself

• The recursive call is made after processing

• The recursive call is made before processing