Four weeks is a tight window, but it's enough to make a real difference on the AP Computer Science A exam, if you use the time strategically. The students who improve the most in this stretch aren't the ones who study the longest; they're the ones who practice writing code every single day and spend the final week doing timed FRQ sets instead of rereading their notes.
This plan is designed for students who have completed AP CS A coursework but want structured, focused exam prep. It works equally well for self-studiers who are learning the material on their own. Each week has a clear content focus, and each day has a specific task so you're never wondering what to work on next.
Before You Start: Know What's on the Exam
The AP CS A exam is three hours: 40 multiple-choice questions in the first 90 minutes, then four free-response questions in the second 90 minutes. The MCQ section tests your ability to read and trace Java code. The FRQ section tests your ability to write it.
The College Board tests the following topic areas, weighted roughly as follows:
| Topic | Approximate Exam Weight |
|---|---|
| Primitive types, operators, String basics | 2–5% |
| Using objects, String methods, Math class | 5–7.5% |
| Boolean expressions and conditionals | 15–17.5% |
| Iteration (loops) | 17.5–22.5% |
| Writing classes | 5–7.5% |
| Array (1D) | 10–15% |
| ArrayList | 2.5–7.5% |
| 2D Arrays | 7.5–10% |
| Inheritance | 5–10% |
| Recursion | 5–7.5% |
Notice where the weight is concentrated: conditionals, iteration, and arrays together make up roughly half the exam. If you're short on time, those topics deserve the most attention.
How to Use This Plan
Each week runs Monday through Saturday. Sundays are off: rest is part of studying. Daily sessions should run 45 to 60 minutes, with practice always taking priority over passive review. Reading about loops is not the same as writing loop problems under time pressure.
Two non-negotiable rules for the whole four weeks:
- Write code by hand every day. The FRQ section is on paper. You won't have autocomplete or a compiler. Students who only practice on a computer are often surprised how much harder it is to write correct syntax without help.
- Check your errors immediately. Every time you get something wrong, figure out exactly why before moving on. Vague awareness that you "messed up the loop" doesn't help. Identifying the specific mistake does.
Week 1: Java Fundamentals and Control Flow
Before you can tackle classes or recursion, the basics need to be automatic. This week covers the building blocks that appear in almost every FRQ and MCQ.
| Day | Topic | Practice Task |
|---|---|---|
| Mon | Primitive types: int, double, boolean. Casting, integer division, modulo. | Write 10 expressions by hand. Predict the result before evaluating. |
| Tue | String methods: length(), substring(), indexOf(), equals(), compareTo(). | Trace 5 String manipulation problems. Write one method that reverses a String character by character. |
| Wed | Boolean expressions, compound conditions (&&, ||, !), short-circuit evaluation. | Convert 5 English conditions into boolean expressions. Trace truth tables for compound conditions. |
| Thu | Conditionals: if, else if, else. Nested conditionals. Common mistakes with == vs .equals(). | Write a method that takes a score (0–100) and returns a letter grade. Use nested conditionals correctly. |
| Fri | for loops, while loops. Loop patterns: sum accumulation, counting, max/min finding. | Write three loop problems by hand: sum all integers 1–n, count even numbers in a range, find the largest value in a sequence entered by the user. |
| Sat | Review + mixed practice. | Do 15 MCQ questions covering this week's topics. Check every wrong answer and trace why it was wrong. |
Key things to nail this week
- Integer division truncates, not rounds.
7 / 2is3, not3.5. If you need3.5, at least one operand must be adouble:7.0 / 2or(double) 7 / 2. - The modulo operator gives the remainder.
13 % 5is3. It's used constantly for checking even/odd, cycling through ranges, and extracting digits. Get comfortable with it. - Never use
==to compare Strings.==checks whether two variables point to the same object in memory..equals()checks whether the content is the same. On the exam,==comparisons on Strings are almost always wrong. - Know your off-by-one errors.
for (int i = 0; i < n; i++)runsntimes (indices 0 through n−1).for (int i = 1; i <= n; i++)also runsntimes (indices 1 through n). They're not interchangeable; pick the right one for the context.
Week 2: Classes, Objects, and Inheritance
The FRQ section almost always includes a class-writing question. This week covers everything you need to define a class from scratch, write constructors and methods correctly, and understand how inheritance and polymorphism work.
| Day | Topic | Practice Task |
|---|---|---|
| Mon | Anatomy of a class: instance variables, constructors, accessor (getter) and mutator (setter) methods. | Write a BankAccount class from scratch with a balance field, a constructor, deposit(), withdraw(), and getBalance(). |
| Tue | static vs. instance variables and methods. this keyword. toString(). | Add a static field to BankAccount that counts the total number of accounts created. Add a toString() method. |
| Wed | Inheritance: extends, super(), overriding methods, the @Override annotation. | Create a SavingsAccount class that extends BankAccount. Override withdraw() to prevent negative balances. |
| Thu | Polymorphism: assigning a subclass object to a superclass reference. Which method runs at runtime vs. compile time. Casting. | Write 5 tracing problems: given a mix of superclass and subclass references, predict what each method call returns. |
| Fri | Abstract classes, interfaces (light coverage). The Comparable interface and compareTo(). | Implement Comparable<BankAccount> on BankAccount so accounts can be sorted by balance. |
| Sat | Review + FRQ practice. | Write one complete class-writing FRQ under timed conditions (22 minutes). Grade it using the scoring rubric from the College Board's released materials. |
Key things to nail this week
- Constructors don't have a return type. Not even
void. If you writepublic void BankAccount(), that's a regular method namedBankAccount, not a constructor. The compiler won't always catch this in a useful way. super()must be the first line in a subclass constructor. If you callsuper()anywhere else, it's a compile error.- Overriding vs. overloading are not the same thing. Overriding replaces a superclass method with the same signature in a subclass. Overloading creates multiple methods with the same name but different parameter lists in the same class. The exam tests both; know which is which.
- Polymorphism: the declared type determines what methods you can call. The actual type determines which version runs. If
BankAccount b = new SavingsAccount(), you can only call methods declared inBankAccount, but ifwithdraw()is overridden,SavingsAccount's version runs at runtime.
Week 3: Arrays, ArrayLists, and Recursion
Arrays and ArrayLists appear in every FRQ set. Recursion shows up on both MCQ and FRQ. This week covers the data structures and algorithms that earn the most points on the exam.
| Day | Topic | Practice Task |
|---|---|---|
| Mon | 1D arrays: declaration, initialization, traversal with for and enhanced for loops. Algorithms: find min/max, sum, linear search. | Write methods to find the minimum value in an array, compute the average, and count how many elements exceed a given threshold. |
| Tue | Array algorithms: reversing, shifting elements, removing by index (shifting left). Common traps with off-by-one errors. | Write a method that removes all occurrences of a given value from an array and returns a new array with only the remaining elements. |
| Wed | ArrayList: declaration, add(), get(), set(), remove(), size(). Traversal. Removing elements during traversal (iterate backwards). | Rewrite Tuesday's "remove all occurrences" problem using an ArrayList. Then write a method that removes all negative numbers from an ArrayList in place. |
| Thu | 2D arrays: row-major traversal, column-major traversal, jagged arrays, common algorithms (row sums, spiral, rotate). | Write methods to compute the sum of each row, find the largest value in a 2D array, and transpose a square matrix. |
| Fri | Recursion: base case, recursive case, tracing call stacks. Classic patterns: factorial, Fibonacci, sum of digits, reverse a String. | Trace three recursion problems by hand, drawing the full call stack. Then write countOccurrences(String s, char c) recursively. |
| Sat | Review + FRQ practice. | Write one array/ArrayList FRQ and one methods-and-control-structures FRQ under timed conditions. 22 minutes each. |
Key things to nail this week
- Don't use an enhanced for loop when you need the index.
for (int x : arr)gives you the value but not the position. If you need to modify elements or track position, use a standardforloop with an index variable. - When removing from an ArrayList inside a loop, iterate from back to front. Removing an element shifts everything after it left by one, which causes you to skip elements when iterating forward. Going backwards avoids this entirely.
- 2D array dimensions:
arr.lengthis the number of rows.arr[0].lengthis the number of columns. Mixing these up causesArrayIndexOutOfBoundsException. - Every recursive method needs a base case that stops the recursion. Without one, you get infinite recursion and a
StackOverflowError. On the exam, always identify the base case before writing the recursive case.
Week 4: FRQ Practice and Full Mock Exam
Content review is over. Week 4 is entirely about exam simulation and targeted cleanup. The goal is to build the kind of fluency that lets you write correct Java under time pressure without second-guessing yourself.
| Day | Focus | Task |
|---|---|---|
| Mon | FRQ: Methods and Control Structures | Write two past FRQs from this category under timed conditions (22 min each). Score both using official rubrics. Review every point you missed. |
| Tue | FRQ: Classes | Write two class-writing FRQs under timed conditions. Focus on constructor syntax, accessor/mutator correctness, and method signatures. |
| Wed | FRQ: Array/ArrayList | Write two array or ArrayList FRQs under timed conditions. Practice both int[] and ArrayList<Integer> versions of similar problems. |
| Thu | FRQ: 2D Arrays + weak area review | Write one 2D array FRQ. Spend the second half of the session re-drilling whichever topic has cost you the most points this week. |
| Fri | Full mock exam | Simulate the real exam: 40 MCQ in 90 minutes, then 4 FRQs in 90 minutes. No breaks in between. No looking things up. Grade everything and record your score. |
| Sat | Mock exam review | Go through every wrong MCQ answer and every point deducted on FRQs. For each mistake, write the correct version. Don't start new material. |
Where to find past FRQs
The College Board publishes free-response questions and scoring guidelines going back many years at apcentral.collegeboard.org. Search for "AP Computer Science A free response." The scoring guidelines are essential: they show exactly what earns each point, which teaches you how the exam is graded in a way that no textbook can.
For the mock exam, the College Board also publishes sample MCQ sets. Use those rather than third-party questions: the official questions are the most reliable representation of what the real exam looks like.
The Week of the Exam
Don't try to cover new material the week of the exam. Your job that week is to stay sharp without burning out.
- Monday and Tuesday: review your most common FRQ mistakes. Rewrite the methods you got wrong. Drill the specific syntax errors you keep making.
- Wednesday: do 20 MCQ questions at a relaxed pace. Review the ones you miss. Stop after an hour.
- Thursday (the day before): do nothing more than a light skim of your notes. Get your materials ready: pencils, your ID, anything you need to bring. Sleep by 10 p.m.
- Exam day: eat a real breakfast. Arrive early. During the exam, if you're stuck on an MCQ, eliminate wrong answers and move on; don't let one question eat five minutes. On FRQs, write something for every part, even if it's incomplete; partial credit is real.
FRQ Habits That Protect Points
These are the habits that separate students who score 4s and 5s from students who know the material but still lose points to execution errors.
- Write method headers exactly as specified. If the FRQ says
public int getTotal(int[] values), write exactly that. Changing the return type or parameter type loses the method header point automatically. - Don't use
System.out.println()when the question asks you to return a value. This is one of the most common mistakes on the class-writing FRQ.returnandprintare not interchangeable. - Don't rewrite helper methods that are given to you. FRQs often tell you that a class has certain methods already defined. Assume they work correctly and call them. Rewriting them wastes time and can introduce errors.
- Write all four parts, even if you're not sure. FRQ parts are scored independently. A wrong answer on part (a) doesn't prevent you from earning full credit on part (b). Leaving a part blank guarantees zero; writing something earns at least a chance.
- Watch your semicolons and braces. Graders apply a "follow-through" policy for some errors, but a missing closing brace can make your entire method unreadable. Take 30 seconds at the end of each FRQ to scan for missing punctuation.
Time Allocation Each Day
If you have exactly one hour per day, here's how to split it:
| Activity | Weeks 1–3 | Week 4 |
|---|---|---|
| Concept review (notes, examples) | 15 min | 0 min |
| Writing code by hand | 30 min | 45 min |
| Checking answers and tracing errors | 15 min | 15 min |
If you can find 90 minutes on Saturdays, use the extra time for a second FRQ or a longer MCQ set. Don't just read more notes; the bottleneck is almost never knowledge, it's execution speed and accuracy under pressure.
Signs You're on Track
After each week, check yourself against these benchmarks:
- End of Week 1: you can trace any loop or conditional problem correctly on the first try, and you catch your own
==vs..equals()mistakes before finishing. - End of Week 2: you can write a complete class from scratch, including constructor, instance variables, and at least two methods, in under 15 minutes with no syntax errors.
- End of Week 3: you can traverse a 2D array in any direction without looking anything up, and you can trace a recursive method by drawing the call stack correctly.
- End of Week 4: your mock exam score is in the range you're targeting. If it's not, you know exactly which topic areas to spend the final days on.
Want a Shortcut? That's What the Crash Course Is For.
This plan works, but it requires self-discipline and the ability to identify your own gaps. If you'd rather have an expert structure your prep, give you targeted feedback on your FRQs, and run you through a graded mock exam, ExamReadyUSA's 4-week AP CS A Crash Course does exactly that. Groups are capped at 5 students, every session is taught by Namrata Poladia (a College Board AP Reader), and the course follows the same four-week progression outlined here, with the advantage of real-time feedback on your code.