AP CSA Recursion Trace Problems with Solutions
Practice tracing recursive methods exactly the way the AP CSA exam tests them. Each problem gives you a method and a specific call — your job is to trace through and determine the return value or output. Full step-by-step solutions included.
🎓 How to Use This Page
For each problem: (1) Read the method carefully. (2) Write your trace on paper before looking at the answer. (3) Click to reveal the solution. (4) Compare your trace to the solution step by step. If you got the answer right but your trace was wrong, you got lucky — fix your method.
✏ Problems
Score: 0 / 10
❓ Frequently Asked Questions
How many recursion questions are on the AP CSA exam?
Typically 2-4 of the 42 MCQ involve recursion tracing. Binary search (which uses recursion) may appear as additional questions. Recursion does not appear on the FRQ section of the 2026 exam.
What difficulty level are these problems?
These problems match AP exam difficulty. They include numeric recursion, String recursion, print-before-and-after patterns, and methods with multiple recursive calls. Start with problems 1-4 if you are new to tracing.
Should I memorize recursion patterns?
No. Always trace step by step for the specific input given. Trying to recognize patterns (like factorial or fibonacci) can lead to errors when the method has a slight twist you did not expect.
About the Author: Tanner Crow has 11+ years of AP Computer Science teaching experience, 1,845+ verified tutoring hours, and a 5.0 rating. His students score 5s at over double the national rate.
Book a tutoring session →