Recursive Trace Java

What is the name of the recursive method discussed?

• recursion

• mystery

• trace

• integer

What is the base case for this recursive method?

• If n is greater than zero

• If n is equal to zero

• If n is less than zero

• If n is a positive number

What value does the method return in the base case?

• 0

• 1

• 2

• 4

How many recursive calls does this method make in its recursive case?

• 1

• 2

• 3

• 4

What initial value of n is used to trace through the method?

• 2

• 3

• 4

• 5

What are the recursive calls made when n is 2?

• mystery(1) and mystery(-1)

•  mystery(1) and mystery(0)

• mystery(0) and mystery(-2)

• mystery(2) and mystery(-1)

What is the result of mystery(0)?

• 2

• 4

• 6

• 8

What is the final result of mystery(3)?

• 8

• 10

• 12

• 14

Based on the entire video, which of the following best describes the process of tracing a recursive method?

• It always results in a simple, linear sequence of calculations

•  It requires solving each branch independently without any relation to other branches

• It involves following multiple branches but can use results from previously solved branches to simplify later calculations

• It is impossible to trace without a computer