A hundred and twenty cards covering everything AP Computer Science A expects you to know cold, sized for a pocket and printed heavily enough to survive a school year in a bag.

One idea per card. If a concept needed two cards it got two cards rather than a smaller typeface.

What is on them

• Syntax: 24 cards — declarations, control flow, method signatures, class structure

• String and array methods: 20 cards, exactly the ones the exam uses and none of the ones it does not

• Traversal patterns: 14 cards — the standard loops for arrays, 2D arrays and ArrayList

• Object concepts: 22 cards on encapsulation, inheritance, polymorphism and interfaces

• Recursion: 12 cards, each with a hand-trace on the reverse

• Sorting and searching: 10 cards with the algorithm on one side and its behaviour on the other

• Traps: 18 cards on integer division, off-by-one, reference versus value, and the rest

The reverse side

Every card has a question on the front and the answer on the back, so the deck works for retrieval practice rather than for reading. Used the other way round it is just a very expensive summary.

120 cards, 3.5 x 2.5 inches, 350gsm with a matte finish. Boxed, with a divider set for sorting into known and not-yet.