4.1 Recursion (Java)

___________ is when the recursive method stops calling itself.

• Base case

• Worst Case

• Best Case

• Simple Case

The program may run out of memory in a

• non-recursive function call

• recursive function call

• condition when too many variables are declared

• none of the above

Which of the following condition is true?

• Recursion is always better than iteration.

• Recursion uses more memory as compared to iteration.

• Recursion uses less memory as compared to iteration.

• Iteration is always better and simpler than recursion.

Which of the following problems can be solved using recursion?

• Finding n^th number of the Fibonacci sequence

• Finding the factorial of a number

• Finding the length of a string

• All of the above

What would happen if the base case is not defined in the recursive method?

• Stack Overflow

• Stack Underflow

• Program Crashes

• None of the above

In the recursive call, the argument should grow/shrink towards the ________.

• base case

• end

• next recursive call

• none of the above

What is returned as a result of the call mystery(4,6)?

• 2

• 3

• 4

• 1

From the previous question, how many times did mystery() get called/ invoked?

• 1

• 2

• 3

• 4

What is the returned value of recMethod(5)?

• 68

• 70

• 75

• 82

In the previous question, how many times did recMethod() get called/invoked?

• 1

• 2

• 3

• 4