中文（繁體）
中文（简体）
English
AP Computer Science A Drill Guide: 42 MCQs, 4 Free Responses, 3-Hour Pacing
TUTORZONE EXAM DRILL GUIDE · AP COMPUTER SCIENCE A
Built on the College Board course and exam description: Section I is 42 multiple-choice questions worth 55%, Section II four free-response questions worth 45%, each section 1 h 30 min for a 3-hour paper, answered entirely in Java. The free-response questions are released each year; the multiple-choice ones appear only in the classroom practice platform. Method only here: what each section tests, the drill order, how to spend three hours, the usual mark losses, the error log and a 12-week timetable. For questions with worked answers, use the original mock paper linked below.
How is AP Computer Science A assessed, and what does each part carry?
Section II (Free Response): 4 questions, write Java code (45%); Section I (Multiple Choice): 42 questions, occasional sets (55%)
Assessment at a glance (2027)
| Component | Content | Weighting | Duration |
|---|---|---|---|
| Section II (Free Response) | 4 questions, write Java code | 45% | 1 h 30 min |
| Section I (Multiple Choice) | 42 questions, occasional sets | 55% | 1 h 30 min |
AP CSA drilling technique: in Section II write correct method signatures, types and indentation; trace loops writing i and sum each pass. Array indices start at 0.
What each paper is actually testing
| Paper | Drill focus | How marks are lost |
|---|---|---|
| Section II (Free Response) | methods, control, arrays, classes | Free response judged on output alone: wrong method signature or parameters, no handling of the boundary cases (empty array, null, negative input), array and ArrayList converted in a forbidden way, and a question that bans a particular method while the answer uses it anyway |
| Section I (Multiple Choice) | eliminate clearly wrong options | Multiple choice tracked by eye: loop, recursion and object-reference questions answered without writing each variable value down, == confused with equals(), int and Integer autoboxing mixed up, and set-based questions answered without re-reading which line the sub-question asks about |
What is each AP Computer Science A paper really testing, and what should you drill?
Section II (Free Response): methods, control, arrays, classes; Section I (Multiple Choice): eliminate clearly wrong options
Drill order: by topic, then by year, then the mark scheme
| Step | What you do | Why |
|---|---|---|
| 1. By topic | Work through each topic, starting with the paper that allows least help (no calculator / closed book) | Exposes what is genuinely not understood |
| 2. By year | Whole papers to time, one or two a week | Trains pace, stamina and question selection |
| 3. Mark scheme | Go through the marking scheme question by question and log the scoring steps you missed | Most lost marks are written wrong, not thought wrong |
Should drilling go by topic first or by year?
By topic first, then whole papers by year, then the mark scheme. The first third of the time goes topic by topic (8-10 years of the same topic back to back), the middle switches to timed whole papers, and the last fortnight only redoes the recurring errors from your log.
A 12-week drilling timetable
| Week | Phase | What to do |
|---|---|---|
| Weeks 1-3 | By topic: foundation | Topic by topic, starting with the easiest marks, building habits and recall |
| Weeks 4-6 | By topic: core | 8-10 years of the same topic back to back, errors classified by topic |
| Weeks 7-8 | By topic: advanced and electives | Elective and higher-order topics, now under time pressure |
| Weeks 9-10 | By year: timed papers | One full paper a week, timed, no reference materials |
| Week 11 | Mark scheme work | Question by question against the marking scheme; list the scoring steps you omitted |
| Week 12 | Plug holes and simulate | Only the recurring errors from your log, then one full exam simulation |
Subject-specific weighting for this timetable: Twelve weeks in four blocks: syntax basics, data structures, the four free-response families, then full papers under time. Weeks 1-3 cover single-concept multiple-choice questions (operator precedence, casting, if and loop tracing) with every variable value written down; weeks 4-6 cover arrays, ArrayList and two-dimensional arrays, handwriting the standard traversal and the boundary conditions (length against size()); weeks 7-9 are the four free-response families (methods and control, class design, arrays and ArrayList, two-dimensional arrays), three questions a week, signature first and then the body, self-marked against the official scoring guidelines; weeks 10-11 are two full papers each, free response first; week 12 reworks only the question types that repeat in the error log, with method signatures memorised.
Use it properly: this is not a checklist to finish. Every week must keep time for redoing errors, or from week 9 you will be repeating the same batch.
Pacing
| Paper | Time | Suggested split |
|---|---|---|
| Section II (Free Response) | 1 h 30 min | about 20 min per question |
| Section I (Multiple Choice) | 1 h 30 min | about 2 min per question |
How should the time be split inside each AP Computer Science A paper?
Section II (Free Response): about 20 min per question; Section I (Multiple Choice): about 2 min per question
The drilling mistakes that cost the most marks
| Mistake | What it looks like | What actually happens | Instead |
|---|---|---|---|
| Loop bound off-by-one | sum as 15 (i=5) | i < 5 means i runs 0..4 | sum = 10 |
| 1-based index | First element a[1] | Java arrays are 0-based | First element a[0] |
| Class/object mixed | Object as blueprint | Class is blueprint, object is instance | Class=blueprint, object=instance |
The error log and the mark scheme
Four columns: error type (concept, boundary case, syntax, misreading), the line that failed (line number plus the variable values at that point), what the scoring guideline asks for (point by point on free response; on multiple choice, why the right option is right and which step went wrong), and the concrete next action (for example, write three boundary test values before the body). Rework the week’s errors every Sunday; a second mark for a repeat, and anything marked twice goes onto a one-page master list.
How many years should you drill?
The free-response questions are released every year, and eight to ten years is enough to cover all four families; the multiple-choice questions are not released, only classroom practice items, so that section has to be built from same-shape questions and original mocks rather than ten years of real papers. Order: three years by question family first, then whole papers by year, and only the repeating error types in the last two weeks.
How many years of past papers is enough?
The free-response questions are released every year, and eight to ten years is enough to cover all four families; the multiple-choice questions are not released, only classroom practice items, so that section has to be built from same-shape questions and original mocks rather than ten years of real papers. Order: three years by question family first, then whole papers by year, and only the repeating error types in the last two weeks.
Frequently asked questions
Is this page a mock paper or a drilling guide?
This is the AP Computer Science A drilling guide: assessment structure, drill order, a 12-week timetable, pacing, common mark losses and the error-log method. For questions with answers, use the AP Computer Science A mock papers linked under Related.
By topic or by year first?
By topic. Eight to ten years of the same topic back to back is what exposes repeating errors; going straight to whole papers just repeats the same batch under time pressure.
How should the error log be written?
Do not copy out questions. Per error record four things: question reference, which step failed (concept, wording, calculation), what the mark scheme requires, and the correct action next time.
No released multiple-choice papers exist, so how is that section drilled?
Build on the classroom practice items and rewrite them by knowledge point (change the numbers, the types, the loop condition), and be able to say why each of the other three options is wrong. Time the full paper on an original mock and put the clock pressure on the free-response half.
How much Java syntax has to be memorised for the free response?
Not to compiler level, but the four skeletons must be hand-written from memory: method signatures, the standard for and while traversals, adding and removing in arrays and ArrayList, and constructors with accessors. No syntax hints are given in the exam and one misplaced brace voids the answer, so write the whole segment out every time.
Official references
| Resource | What to use it for |
|---|---|
| College Board AP Computer Science A exam page | Confirm the format and question counts |
| https://www.tutorzone.com.hk/en-ap-statistics-mock-2027/ | AP Statistics drilling mock |
Related: AP Computer Science A original mock (multiple choice plus four free-response questions, with worked answers) · practice area
Next step: find a tutor / register as a tutor
After drilling, the hard part is telling a conceptual error from a writing error. Tell us the year group, the school and your available times, and TutorZone will match you with a tutor who knows the HKEAA assessment requirements.
Demand for tutors in this subject is steady, and those who can explain the marking scheme and where marks are won are especially sought after. Register free; you pay only when a match succeeds.
