Understanding Recursion Concepts

What is a recursive method?

• A method that returns a value

• A methods that calls itself

• A method that takes no arguments

• A method that uses iteration

Recursion can be a substitute for...

• addition

• subtraction

• iteration

• multiplication

What is one disadvantage of recursion?

• It is difficult to read.

• It is always slower than iteration.

• It sometimes uses more memory.

• It cannot be used with sorting algorithms.

Which is try about a recursive method?

• It must have a return type of void.

• It calls itself directly or indirectly.

• It cannot have any parameters.

• It must be defined within a separate class.

Which of the following is the most important part of a recursive method in Java?

• The method signature

• The recursive call

• The base call

• The access modifier

What happens if a recursive method in Java does not have a base case, or if the base case is never reached?

• The program will crash.

• The method will return null.

• The program may throw a StackOverflowError.

• The program will enter an infinite loop, but will not crash.

Consider the Java code snippet:
What does this method calculate?

• The factorial of n

• The sum of numbers 1 to n

• n raised to the power of 2

• The sum of even numbers from 0 to n

In Java, where are the method calls in a recursive function stored?

• in the heap

• in the stack

• in the queue

• in the cache

When should you choose recursion over iteration in Java?

• Always, recursion is generally more efficient

• Never, iteration is always preferred

• When the problem can naturally be broken down into smaller, self-similar subproblems

• When you need to optimize memory storage

What is the base case in a recursive function?

• The case that makes the function call itself

• The case that stops the recursion

• The case that returns an error

• The case that handles the input