AP Computer Science A: Recursion Quiz

What is recursion?

• A method that uses loops

• A method that calls itself

• A method that returns a value

• A method that calls another method

What is the base case in recursion?

• The simplest version of the recursive process

• The most complex version of the recursive process

• The point where the problem cannot be reduced any further

• The point where the problem starts

What is the purpose of a base case in recursion?

• To return a value

• To make the problem more complex

• To call another method

• To halt the recursion

What do recursive methods contain?

• Only recursive calls

• Only base cases

• No base cases or recursive calls

• At least one base case and at least one recursive call

What do parameter values capture in a recursive process?

• The result of the recursive process

• The progress of a loop

• The progress of the recursive process

• The base case of the recursive process

Can any recursive solution be replicated through the use of an iterative approach?

• It depends on the problem

• Sometimes

• No

• Yes

What can recursion be used to traverse?

• String, array, and ArrayList objects

• Only String objects

• Only ArrayList objects

• Only array objects

How many times will the sumArray method be called for an array of length 5?

• 6

• 7

• 5

• 8

What is the generic formula for summing numbers using recursion?

• sum(n) = n - sum(n - 1)

• sum(n) = n / sum(n - 1)

• sum(n) = n * sum(n - 1)

• sum(n) = n + sum(n - 1)