Digital Logic and Computer Organization (Nand2Tetris +

reading · we frame, you read MIT or the canonical taught · we author, no canonical fits ↺ spirals back to earlier lessons

Course locked

Complete String Algorithms and Complexity Theory first.

This course unlocks once you've finished its prerequisite. Open prerequisite →

Prerequisites

Systems Programming (C and Zig) not yet

Complete prerequisites first to enroll.

reading · 30 min + ~378 min canonical

Number Systems and Boolean Algebra: The Two Ideas Under Everything

Every value your programs have ever touched — an integer, a string, a floating-point price, a JSON blob, this sentence — was, at the bottom, a pattern of high and low voltages on …

primary Nand2Tetris Part 1 on Coursera

preview →

reading · 30 min + ~378 min canonical L1

Combinational Circuits and the ALU: Building Arithmetic from Gates

In the last lesson you had gates: AND, OR, NOT, and the universal NAND. A gate is not a computer. This lesson is the jump from "logic" to "arithmetic" — the moment where a handful…

primary Nand2Tetris Part 1 on Coursera

after L1 locked

reading · 30 min + ~378 min canonical L1

Sequential Circuits and State: How a Machine Remembers

Every circuit you built in the last lesson had amnesia. Feed it inputs, it produces an answer, and the instant the inputs change, the old answer is gone with no trace. That's fine…

primary Nand2Tetris Part 1 on Coursera

after L2 locked

reading · 35 min + ~378 min canonical L1

The CPU: Datapath, Control, and Instruction Sets

This is the lesson where the computer turns on. You have an ALU that computes (lesson 2) and registers that remember (lesson 3). What you don't yet have is anything that decides w…

primary Nand2Tetris Part 1 on Coursera

after L3 locked

reading · 30 min + ~378 min canonical L1

Caches and the Memory Hierarchy: Why Fast Memory Is a Lie You Manage

Lesson 4 told you a small lie to keep the story clean: that when the CPU reads from memory, the value just shows up. It doesn't. Main memory is dramatically slower than the CPU — …

primary Nand2Tetris Part 1 on Coursera

after L4 locked

exercise reading · 15 min L1

Exercises: Easy (Warm-up)

- [ ] N2T Project 1: Boolean Logic — Build Not, And, Or, Xor, Mux, DMux from NAND gates - [ ] N2T Project 2: Boolean Arithmetic — Build HalfAdder, FullAdder, Add16, Inc16, ALU - […

after L5 locked

exercise reading · 30 min L1

Exercises: Medium (Core)

- [ ] N2T Project 3: Sequential Logic — Build Bit, Register, RAM8, RAM64, RAM512, RAM4K, RAM16K, PC - [ ] N2T Project 4: Machine Language — Write Mult and Fill programs in Hack as…

after L6 locked

exercise reading · 45 min L1

Exercises: Hard (Stretch)

- [ ] Extend the Hack ALU to support multiplication — Design the circuit, implement in HDL - [ ] Analyze pipeline stalls — Given a sequence of MIPS instructions, identify all RAW/…

after L7 locked

exercise reading · 60 min L1

Mini-Project

- [ ] Complete Nand2Tetris Projects 1-5 — Build an entire computer from NAND gates: logic gates, ALU, memory, CPU, and computer; run test programs on your hardware

after L8 locked

L10

project reading · 720 min L1

Project: Nand2Tetris Projects 1-3

Build logic gates from NAND (Project 1), arithmetic chips including ALU (Project 2), and sequential chips including registers and RAM (Project 3). These are the official Nand2Tetr…

after L9 locked

L11

project reading · 600 min L1

Project: Nand2Tetris Projects 4-5

Write programs in Hack assembly (Project 4) and build the complete Hack CPU and computer (Project 5). At this point you have a working computer built from NAND gates. (~10 hours)

after L10 locked

L12

project reading · 600 min L1

Capstone: Nand2Tetris — Complete Computer

- [ ] Milestone 1: Nand2Tetris Project 1 — All logic gates from NAND - [ ] Milestone 2: Nand2Tetris Project 2 — ALU and arithmetic chips - [ ] Milestone 3: Nand2Tetris Project 3 —…

after L11 locked

L13

assessment reading · 63 min L1

Self-Assessment: Digital Logic and Computer Organization (Nand2Tetris + Theory)

- [ ] What is a NAND gate? Why can all other gates be built from NAND? - [ ] What is the difference between combinational and sequential circuits? - [ ] Explain how an ALU works a…

after L12 locked

13 lessons. Read in order; spiral back when you need to. By the end you'll have used the core ideas twice — once on the abstract, once on something you'll meet at work next week.