AP CSA Recursion 3

Question 1

What is a recursive method that counts down from n printing each number called?

Accepted Answer

Linear recursion

Answer

Binary recursion

Answer

Tail recursion

Answer

Mutual recursion

Question 2

What must be true about the argument in each recursive call to guarantee termination?

Accepted Answer

It must move closer to the base case

Answer

It must be larger than the original

Answer

It must be the same value

Answer

It must be a String

Question 3

How many total method calls does factorial(4) make (including the initial call)?

Accepted Answer

5

Answer

4

Answer

3

Answer

6

Question 4

Which of the following is NOT an advantage of recursion?

Accepted Answer

Always more memory-efficient than iteration

Answer

Can simplify code for problems with recursive structure

Answer

Natural fit for tree traversal

Answer

Models mathematical induction directly

Question 5

What is 'unwinding the stack' in recursion?

Accepted Answer

The process of returning from recursive calls back to the original caller

Answer

The process of making recursive calls deeper

Answer

Clearing all local variables

Answer

Throwing an exception from a recursive call

Question 6

In AP CSA, which searching algorithm is commonly implemented recursively?

Accepted Answer

Binary search

Answer

Linear search

Answer

Selection sort

Answer

Bubble sort