Recursion

What is recursion in programming?

• A method that calls itself

• A method that runs in a loop

• A method that sorts data

• A method that uses arrays

Which of the following is a base case in recursion?

• A case that runs indefinitely

• A case that uses loops

• A case that does not call itself

• A case that calls itself multiple times

What does the binary search algorithm do?

• Reverses a list

• Counts the number of items

• Sorts a list of items

• Finds an item in a sorted list

In the factorial method, what is the base case?

• 1! = 1

• 0! = 1

• N! = N + (N-1)!

• N! = N * (N-1)!

What is the result of factorial(3)?

• 2

• 3

• 9

• 6

What is the Fibonacci sequence?

• A sequence of odd numbers

• A sequence of prime numbers

• A sequence where each number is the sum of the two preceding ones

• A sequence of even numbers

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

• It will sort the data

• It will return zero

• It will run successfully

• It may cause a stack overflow error

Which of the following is an example of a recursive algorithm?

• Searching for an item in a list

• Sorting an array

• Calculating the factorial of a number

• Counting the number of elements in a list

What is the purpose of decomposition in recursion?

• To break a problem into smaller identical problems

• To combine results from different methods

• To sort data efficiently

• To create loops

In the context of recursion, what does composition refer to?

• Combining the results of smaller problems

• Defining a base case

• Breaking down a problem

• Creating a loop