1. Foundations

Curriculum

Foundations

Execution model, recursion, complexity, and state machines — how a program actually runs

Execution Model

Execution Trace

Follow the program counter, the current statement, and how each step changes state.

PCState

Variables & Mutation

Assignment, overwriting, and references — watch old values give way to new ones.

AssignReference

Arrays & Indexing

Contiguous storage, indices, traversal, and what going out of bounds really means.

IndexBounds

Loops & Invariants

Loop variables, the invariant that holds each pass, and the termination condition.

InvariantTerminate

Abstraction

Recursion & the Call Stack

Calls pushed and popped, return values, and a recursion unwinding frame by frame.

Call stackUnwind

Big-O by Counting Steps

Build O(1), O(n), O(n²), and O(log n) intuition by counting operations on screen.

O(n)Counting

State Machines

States, events, and transitions — the groundwork for TCP, OS, and parsers.

StateTransition