Access is restricted
You are not permitted to access this course's announcements and schedule right now.
Course details
Explore comprehensive course materials and learning objectives designed for your growth.
About the course
Most AP Computer Science A courses spend six weeks on syntax and then wonder why students cannot write a program. Syntax is the easy part and it is not what the exam tests. What the exam tests is whether you can hold a small model of a running program in your head and predict what it does.
So this course teaches tracing from the very first week. Before you write your third program you will have hand-traced a dozen, and that habit is the reason our students do disproportionately well on the multiple-choice section.
What you build
Six projects, each introduced when the language has just about caught up with it. They are small on purpose. A project you can finish is worth four you abandon.
A number-guessing game — conditionals, loops and input
A text statistics tool — strings, methods and decomposition
A gradebook — arrays, ArrayList and traversal patterns
A tiny bank simulation — classes, encapsulation and object state
A shape hierarchy that renders itself — inheritance and polymorphism
A maze solver — recursion, and the moment recursion stops feeling like a trick
The rule about explaining
Every project submission includes a ninety-second screen recording of you walking through your own code. If you cannot say what a line does, it does not count as written. This is unpopular in week two and is the single most common thing students thank us for in week twelve.
Exam preparation
Two hundred multiple-choice questions in the AP style, grouped by topic and released as each topic finishes
Every released free-response question since 2015, with a written solution and the scoring rubric applied line by line
Four full practice exams, timed
A tracing drill set — forty code segments, no writing required, just predict the output
Who this is for
Students taking AP CS A at a school where the course is thin, or self-studying it entirely. Students who took AP CS Principles and found it more about concepts than code. And students who have written a little Python and want to understand why Java insists on so much more ceremony.
It is a genuine beginner course. Roughly 60% of each cohort has never written a line of code in any language.
The first three lessons and the first project are open as a free preview. If you get the guessing game running and understand every line of it, you will finish this course.
In this course you will be able to
Write, compile and debug a Java program from a blank file without a template to copy
Trace any AP-style code segment by hand and state the exact output, which is roughly a third of the multiple-choice section
Design a class with proper encapsulation and explain why a field is private
Write the four free-response question types the exam has used every year since 2019
Reason about inheritance and polymorphism well enough to predict which method actually runs
Trace a recursive method to its base case on paper, without a debugger
Explain the runtime difference between a linear search and a binary search, and when the sort that enables it is worth it
Prerequisite
No programming experience at all. This course genuinely starts from a blank file
Algebra I — variables, functions and coordinate pairs are used as analogies throughout
A computer you can install a JDK on. Chromebook users are supported through a browser IDE and there is a setup guide for both
About five hours a week for sixteen weeks; the code has to be typed, not watched
Willingness to be stuck for twenty minutes before asking, which is where the learning is
Topics covered
Primitive types, variables and the difference between assignment and equalityExpressions, operator precedence and integer division as a source of silent bugsBoolean logic, short-circuit evaluation and De Morgan's laws in codeConditionals, nested conditionals and flattening them when they get unreadableIteration: while, for, and choosing between them honestlyNested loops and reasoning about how many times the inner body actually runsStrings as objects, immutability, and the methods the exam expectsArrays, traversal patterns and off-by-one errors as a category rather than an accidentArrayList, autoboxing and the removal-while-iterating trapTwo-dimensional arrays and row-major traversalClasses, constructors, instance variables and encapsulationMethods, parameters, return values and the call stackInheritance, method overriding and polymorphismAbstract classes and interfaces at AP CS A depthRecursion: base case, recursive case, and tracing by handSorting and searching: selection, insertion, merge sort and binary search
