Topic 4 - Recursive

Which of the following best defines recursion?

• A function that calls itself

• A loop within a function

• A function that runs indefinitely

• A function that only executes once

What is the base case in a recursive function?

• The case where the function does not call itself

• The largest problem the function can handle

• The part of the function that runs first

• The part of the function that initializes variables

Which of the following is a necessary condition for a recursive function to terminate?

• Infinite loops

• An iteration statement

• A global variable

• A base case

What is the output of factorial(3)?

• 1

• 3

• 6

• 9

What will happen if the base case is missing in a recursive function?

• The function will return immediately

• The function will result in an infinite loop

• The function will cause a compile-time error

• The function will execute only once

Which of the following problems is most suitable for a recursive solution?

• Sorting a list

• Searching for an element in an unsorted list

• Calculating the factorial of a number

• Adding elements in an array

What is the output of sum(4)?

• 4

• 6

• 10

• 15

What is a potential disadvantage of using recursion?

• More memory usage due to function call stack

• Easier to understand

• Less expressive than iterative solutions

• Cannot solve complex problems

Which of the following is true about recursion in programming?

• Recursion is always more efficient than iteration

• Recursion is useful for tasks that can be broken down into similar subtasks

• Recursion cannot be used for sorting algorithms

• Recursive functions always run faster than iterative functions

In the context of recursion, what is a "recursive case"?

• The condition that stops the recursion

• The part of the function where it calls itself

• The initial call to the recursive function

• The final output of the recursive function