FRQ 1
Methods and control structures. Write two methods, or one constructor and one method, using method calls, conditions/loops and String methods.
Start with the administrative task
Self-study does not register a student for an AP exam. Contact CAIS’s AP coordinator now. Ask the school to confirm in writing that it will order and administer AP Computer Science A in May 2027, place the student in an AP Classroom exam-only section, state its registration/payment deadline, and explain the approved device arrangements. School deadlines can be earlier than College Board ordering deadlines.
Checklist progress is saved only in this browser.
What the student is preparing for
12 May 2027Wednesday · Session 2
3 hoursFully digital in Bluebook
42 MCQ90 minutes · 55%
4 FRQ90 minutes · 45%
FRQ 2
Class design. Implement a class with its header, instance variables, constructor and required method from a specification.
FRQ 3
Data analysis with ArrayList. Traverse and manipulate data stored in an ArrayList.
FRQ 4
2D array. Traverse and manipulate rows, columns and elements in a two-dimensional array.
What counts as “passing”? College Board describes a 3 as “qualified,” but universities decide whether a 3, 4 or 5 earns credit or placement. There is no universal pass threshold. For a useful safety margin, prepare to perform consistently in an estimated 4/5 range.
The complete current course
The revised AP CSA framework has four units, not the old ten. The exam covers a prescribed subset of Java and five recurring practices: design code, develop code, analyse code, document behaviour, and use computers responsibly. Code analysis is especially important, representing 37–53% of the multiple-choice section.
Unit 1 · Using Objects and Methods
- Algorithms, Java program structure, compilation and runtime
- Variables and primitive types:
int,double,boolean - Assignment, arithmetic, compound assignment and remainder
- Integer division, casting, ranges and overflow
- Creating objects; references,
nulland aliasing - Methods, parameters, return values, signatures and overloading
Stringobjects, immutability and prescribed methodsMathmethods and random-number expressions- Wrapper classes; autoboxing/unboxing and conversions
- Comments, documentation, preconditions and postconditions
Output: 25–35 short programs, one mini-project, a unit test and a methods FRQ.
Unit 2 · Selection and Iteration
- Relational/Boolean operators and truth tables
if,if/else, nested and multi-branch logic- De Morgan’s laws and equivalent expressions
- Short-circuit evaluation and safe guard conditions
- Correct primitive, String and reference comparisons
while,forand nested loops- Accumulators, counters, max/min and validation patterns
- String traversal and construction
- Boundary, off-by-one and infinite-loop errors
- Tracing and documenting program behaviour
Output: 40+ tracing/coding exercises, a simulation, two timed FRQ parts and a cumulative test.
Unit 3 · Class Creation
- Class headers, private instance variables and encapsulation
- Constructors—without a return type—and initialization
- Accessor, mutator and behaviour methods
- Public/private and instance/static members
this; local, parameter and instance scope- Pass-by-value and mutation through object references
- Helper methods and decomposition
- Class invariants, preconditions and postconditions
- Client-code testing and reference/runtime errors
Removed topic: inheritance is no longer a core unit. Do not let an old textbook drive the plan.
Output: several small classes and at least four class-design tasks/FRQs.
Unit 4 · Data Collections
- 1D arrays: creation, indexing, length, traversal and mutation
- Indexed versus enhanced
forloops ArrayListwith wrapper/object typesadd,get,set,remove,sizeand safe traversal- 2D arrays: row/column indexing and nested traversal
- Counting, totals, averages, min/max, filtering and replacement
- Searching and prescribed standard sorting algorithms
- Recursion: base cases, recursive calls and tracing
- Reading text files and working with data sets
- Correctness, boundary conditions and runtime errors
Output: array, ArrayList and grid/data projects plus repeated timed FRQ 3 and 4 practice.
35-week preparation calendar
| Dates | Focus | Required work | Checkpoint |
|---|---|---|---|
| 9–30 Sep | Setup + Unit 1 foundations | Register; install tools; diagnostic; syntax, types, expressions, casts, methods and basic objects. Code on four days each week. | Write, compile and debug 10 small programs without AI writing them. |
| October | Finish Unit 1 | Objects, references, Strings, Math, wrappers and documentation. Build a quiz, calculator or simple game. | 65%+ unit MCQ; explain aliasing, integer division, String equality and return values. |
| November | Unit 2A | Boolean logic, conditions, equivalence, short-circuiting and tracing. | Solve unfamiliar condition-tracing problems without running the code. |
| December | Unit 2B | Loops, nested loops, String traversal and common loop algorithms; 8–10 CodingBat problems weekly. | 65%+ cumulative Unit 1–2 test; write standard patterns from a blank screen. |
| January | Unit 3 | Design several small classes and practise new-style specification tables. | Write a complete class—header, fields, constructor and method—in 25 minutes. |
| February | Unit 4A | Arrays and ArrayList; begin one timed collection FRQ each week. | No confusion among array.length, String.length() and list.size(). |
| 1–15 March | Unit 4B | 2D arrays, standard algorithms and data analysis. | Complete ArrayList and 2D-array FRQs under time. |
| 16–31 March | Finish content | Recursion, files/data sets, cumulative review and first full 3-hour mock. | Score with rubrics and rank the top five recurring errors. |
| 1–14 April | Targeted repair | Relearn three weakest areas; two mixed MCQ sets and all four FRQ types each week. | 75%+ mixed MCQ and about 70%+ of available FRQ rubric points. |
| 15–30 April | Exam simulation | Two full timed exams; Bluebook navigation; type code without compiler/autocomplete. | Two consecutive results in the estimated 4/5 range. |
| 1–11 May | Taper | One early final mock, then short error/algorithm review. Confirm device and admission details. | Rested, equipped and consistent—not cramming. |
A repeatable 7½-hour week
2 × 60 min
Learn a topic, then reproduce examples without looking.
Learn a topic, then reproduce examples without looking.
3 × 60 min
Write and debug code from a blank screen.
Write and debug code from a blank screen.
60 min
Trace MCQs by hand and explain each mistake.
Trace MCQs by hand and explain each mistake.
75 min
Complete an FRQ or a small project.
Complete an FRQ or a small project.
15 min
Update the tracker and error log.
Update the tracker and error log.
Every fourth week
Replace the project with a cumulative timed test.
Replace the project with a cumulative timed test.
Recommended balance: about 70% writing/tracing code, 20% explanation and correction, and 10% projects. A topic is secure only when the student can explain it in their own words, trace unfamiliar code, write a short solution independently, answer one or two related questions, and correct their own error.
Progress targets
- December: 65%+ on unit MCQs.
- February: 70%+ and able to complete individual FRQ parts.
- 31 March: all curriculum content completed.
- Mid-April: 75%+ mixed MCQ and about 70% of FRQ rubric points.
- Final two mocks: stable estimated 4/5 performance rather than one unusually good score.
Materials: what is free and what to buy
Free core — enough to complete the course
- College Board CED — authoritative curriculum and samples.
- CSAwesome2 (2026+) — primary interactive course/textbook aligned to the revised framework. Do not use CSAwesome v1 as the main sequence.
- Official Java Quick Reference — keep it open from the first week.
- CodingBat Java — short logic, String, loop and array drills.
- Official released FRQs — questions, rubrics, samples and commentary.
- AP Classroom — official topic questions and progress checks after coordinator enrollment.
- BlueJ or IntelliJ IDEA Community, plus a current Java JDK. BlueJ is simpler for a beginner.
- Bluebook — required digital-exam practice.
Optional paid books — choose one
Recommended: Barron’s AP Computer Science A Premium, 13th Edition, Roselyn Teukolsky and Chris Carman, ISBN 9798349700354. It explicitly covers the revised 2026 exam and includes six practice tests.
Alternative: Princeton Review AP Computer Science A Premium Prep, 9th Edition, ISBN 9780593518410, labelled for the new 2026 exam.
Extra FRQ depth: Be Prepared for the AP Computer Science Exam in Java, 9th Edition (2026). Confirm the edition before buying.
Do not use Barron’s 12th edition or another old 10-unit book as the primary resource. Older books may teach Java adequately, but they can emphasize removed inheritance content, omit files/data sets and describe the former exam.
How to use past exam questions
- During content learning: select individual parts by topic; do not burn full recent papers too early.
- From February: rotate through the four current FRQ categories under a 22-minute target.
- After every FRQ: mark with the official rubric, then rewrite missed sections without the solution.
- In April: reserve enough unused material for two or three full simulations.
Alignment warning: College Board states that older released questions do not completely align with the 2025–26 revision. Prioritize the 2026 set and current FRQ categories. Use 2023–25 questions selectively for still-valid Java skills, and ignore removed-topic points. Score calculators are unofficial estimates; track raw MCQ accuracy and official FRQ rubric points.
What the student must be mindful of
Course identity
AP CSA is not AP CSP. CSA has no Create performance task; it assesses Java programming and code analysis.
Exam environment
FRQs are typed in Bluebook without an IDE compiler, debugger or autocomplete. Practise in a plain editor regularly.
Java boundary
The exam uses a prescribed Java subset. Let the CED and official Quick Reference—not a general Java course—define examinable methods.
Specifications
Correct syntax is not enough. Wrong bounds, return value, mutation or assumptions can cost more than a small syntax slip.
Classic traps
Use .equals for String content; master zero-based indexing and exclusive upper bounds; distinguish length/size forms.
Collection mutation
Removing from an ArrayList while moving forward can skip elements. Trace index shifts explicitly.
Edge cases
Test empty, one-element, first/last-index, all-match/no-match and permitted null cases.
AI discipline
Attempt first. AI may explain or generate fresh practice, but the student must then solve again independently. Otherwise it hides readiness.
Best single strategy: write and trace Java every week from September, finish new content by 31 March, and spend April on timed mixed practice plus disciplined error correction. Consistency beats cramming.
Official references
- College Board: AP Computer Science A course and unit weightings
- College Board: current fully digital exam format
- College Board: 2027 AP exam schedule
- College Board: released FRQs and alignment warning
Planning guide prepared 9 September 2026. Exam arrangements and policies can change; the school coordinator and College Board remain authoritative.