Marlbridge guide to AP® Computer Science A

Unit roadmap

Units and topics exactly as numbered in the 2026–27 Course and Exam Description. Weightings are the official multiple-choice ranges. Marlbridge has written resources for 53 of 53 topics so far; the rest are planned and marked as such.

AP® Computer Science A flashcards: 303 cards, one set per unit, to test yourself on every topic.

1. Unit 1: Using Objects and Methods 15–25% of multiple choice · 15 topics

   • 1.1 Introduction to Algorithms, Programming, and Compilers Study guideRevision notesPractice questionsTopic checklist
   • 1.2 Variables and Data Types Study guideRevision notesPractice questionsTopic checklist
   • 1.3 Expressions and Output Study guideRevision notesPractice questionsTopic checklist
   • 1.4 Assignment Statements and Input Study guideRevision notesPractice questionsTopic checklist
   • 1.5 Casting and Range of Variables Study guideRevision notesPractice questionsTopic checklist
   • 1.6 Compound Assignment Operators Study guideRevision notesPractice questionsTopic checklist
   • 1.7 Application Program Interface (API) and Libraries Study guideRevision notesPractice questionsTopic checklist
   • 1.8 Documentation with Comments Study guideRevision notesPractice questionsTopic checklist
   • 1.9 Method Signatures Study guideRevision notesPractice questionsTopic checklist
   • 1.10 Calling Class Methods Study guideRevision notesPractice questionsTopic checklist
   • 1.11 Math Class Study guideRevision notesPractice questionsTopic checklist
   • 1.12 Objects: Instances of Classes Study guideRevision notesPractice questionsTopic checklist
   • 1.13 Object Creation and Storage (Instantiation) Study guideRevision notesPractice questionsTopic checklist
   • 1.14 Calling Instance Methods Study guideRevision notesPractice questionsTopic checklist
   • 1.15 String Manipulation Study guideRevision notesPractice questionsTopic checklist
   • Using Objects and Methods: Unit Diagnostic (Computer Science A Unit 1)
   • Using Objects and Methods: Mixed Unit Review (Computer Science A Unit 1)
   • Unit 1 flashcards (81 cards)
2. Unit 2: Selection and Iteration 25–35% of multiple choice · 12 topics

   • 2.1 Algorithms with Selection and Repetition Study guideRevision notesPractice questionsTopic checklist
   • 2.2 Boolean Expressions Study guideRevision notesPractice questionsTopic checklist
   • 2.3 if Statements Study guideRevision notesPractice questionsTopic checklist
   • 2.4 Nested if Statements Study guideRevision notesPractice questionsTopic checklist
   • 2.5 Compound Boolean Expressions Study guideRevision notesPractice questionsTopic checklist
   • 2.6 Comparing Boolean Expressions Study guideRevision notesPractice questionsTopic checklist
   • 2.7 while Loops Study guideRevision notesPractice questionsTopic checklist
   • 2.8 for Loops Study guideRevision notesPractice questionsTopic checklist
   • 2.9 Implementing Selection and Iteration Algorithms Study guideRevision notesPractice questionsTopic checklist
   • 2.10 Implementing String Algorithms Study guideRevision notesPractice questionsTopic checklist
   • 2.11 Nested Iteration Study guideRevision notesPractice questionsTopic checklist
   • 2.12 Informal Run-Time Analysis Study guideRevision notesPractice questionsTopic checklist
   • Selection and Iteration: Unit Diagnostic (Computer Science A Unit 2)
   • Selection and Iteration: Mixed Unit Review (Computer Science A Unit 2)
   • Unit 2 flashcards (66 cards)
3. Unit 3: Class Creation 10–18% of multiple choice · 9 topics

   • 3.1 Abstraction and Program Design Study guideRevision notesPractice questionsTopic checklist
   • 3.2 Impact of Program Design Study guideRevision notesPractice questionsTopic checklist
   • 3.3 Anatomy of a Class Study guideRevision notesPractice questionsTopic checklist
   • 3.4 Constructors Study guideRevision notesPractice questionsTopic checklist
   • 3.5 Methods: How to Write Them Study guideRevision notesPractice questionsTopic checklist
   • 3.6 Methods: Passing and Returning References of an Object Study guideRevision notesPractice questionsTopic checklist
   • 3.7 Class Variables and Methods Study guideRevision notesPractice questionsTopic checklist
   • 3.8 Scope and Access Study guideRevision notesPractice questionsTopic checklist
   • 3.9 this Keyword Study guideRevision notesPractice questionsTopic checklist
   • Class Creation: Unit Diagnostic (Computer Science A Unit 3)
   • Class Creation: Unit Review (Computer Science A Unit 3)
   • Unit 3 flashcards (52 cards)
4. Unit 4: Data Collections 30–40% of multiple choice · 17 topics

   • 4.1 Ethical and Social Issues Around Data Collection Study guideRevision notesPractice questionsTopic checklist
   • 4.2 Introduction to Using Data Sets Study guideRevision notesPractice questionsTopic checklist
   • 4.3 Array Creation and Access Study guideRevision notesPractice questionsTopic checklist
   • 4.4 Array Traversals Study guideRevision notesPractice questionsTopic checklist
   • 4.5 Implementing Array Algorithms Study guideRevision notesPractice questionsTopic checklist
   • 4.6 Using Text Files Study guideRevision notesPractice questionsTopic checklist
   • 4.7 Wrapper Classes Study guideRevision notesPractice questionsTopic checklist
   • 4.8 ArrayList Methods Study guideRevision notesPractice questionsTopic checklist
   • 4.9 ArrayList Traversals Study guideRevision notesPractice questionsTopic checklist
   • 4.10 Implementing ArrayList Algorithms Study guideRevision notesPractice questionsTopic checklist
   • 4.11 2D Array Creation and Access Study guideRevision notesPractice questionsTopic checklist
   • 4.12 2D Array Traversals Study guideRevision notesPractice questionsTopic checklist
   • 4.13 Implementing 2D Array Algorithms Study guideRevision notesPractice questionsTopic checklist
   • 4.14 Searching Algorithms Study guideRevision notesPractice questionsTopic checklist
   • 4.15 Sorting Algorithms Study guideRevision notesPractice questionsTopic checklist
   • 4.16 Recursion Study guideRevision notesPractice questionsTopic checklist
   • 4.17 Recursive Searching and Sorting Study guideRevision notesPractice questionsTopic checklist
   • Data Collections: Unit Diagnostic (Computer Science A Unit 4)
   • Data Collections: Mixed Unit Review (Computer Science A Unit 4)
   • Unit 4 flashcards (104 cards)

Exam skills

Guides that apply across every unit: what each task verb asks you to do, and how to set out answers so every step of your reasoning is visible.

• Code Tracing, Multiple Choice and Java Pitfalls: Exam Skills Guide (Computer Science A)

  A method for tracing Java code by hand, a strategy for the multiple-choice section, and the Java behaviours that most often trap students, with original compiled examples.

• The Four Free-Response Question Types: Exam Skills Guide (Computer Science A)

  How to approach each of the four Java free-response questions (methods and control, class design, ArrayList data analysis, 2D array), with original examples, solutions and a suggested rubric.

Computational thinking practices

1. Design Code

Determine an appropriate program design and develop algorithms. (2–10% of multiple choice.)

2. Develop Code

Write and implement program code. (22–38% of multiple choice; every free-response question.)

3. Analyze Code

Determine the output or result of given program code or explain why code may not work as intended. (37–53% of multiple choice.)

4. Document Code and Computing Systems

Describe the behavior and conditions that produce specified results in a program. (10–15% of multiple choice.)

5. Use Computers Responsibly

Understand the ethical and social implications of computer use. (2–10% of multiple choice.)