Engineering · CS
Logic Gates
Wire gates into adders, flip-flops and memory.
Also on your phone · Logic Gates
The course
5 worlds · 38 lessons
World 1 · Gate Fundamentals
FREEThe seven building blocks of every digital circuit- 01Bits, Signals & Truth TablesEverything a computer does is 1s and 0s · 5 min
- 02The AND GateOutput 1 only when every input is 1 · 6 min
- 03The OR GateOutput 1 when at least one input is 1 · 6 min
- 04The NOT Gate (Inverter)Flip the bit · 5 min
- 05The XOR GateOutput 1 when inputs differ · 6 min
- 06NAND — the Universal GateAND, then invert · 6 min
- 07NOR & XNORThe other two inverted gates · 6 min
- 08De Morgan’s LawsTurning ANDs into ORs · 7 min
- 09Gate RoundupAll seven gates, side by side · 5 min
World 2 · Combinational Circuits
PROAdders, multiplexers and comparators from raw gates- 01The Half AdderAdd two bits: Sum + Carry · 8 minPRO
- 02The Full AdderAdd three bits with a carry-in · 10 minPRO
- 03Multi-bit AdditionChaining adders into a ripple-carry adder · 7 minPRO
- 04The 2:1 MultiplexerA data selector — pick input A or B · 9 minPRO
- 05DecodersTurn a binary code into one-hot lines · 7 minPRO
- 06The 1-bit ComparatorAre two bits equal? · 6 minPRO
- 07Boolean AlgebraSimplify before you build · 8 minPRO
- 08Karnaugh MapsA visual way to minimise logic · 9 minPRO
- 09Design ReviewFrom spec to gates · 5 minPRO
World 3 · Sequential Foundations
PROCircuits that remember — latches, flip-flops and counters- 01Combinational vs. SequentialAdding memory to logic · 6 minPRO
- 02The SR LatchThe simplest 1-bit memory · 8 minPRO
- 03The Gated D LatchStore a bit only when enabled · 7 minPRO
- 04The D Flip-FlopCapture on the clock edge · 8 minPRO
- 05RegistersStore a whole number · 6 minPRO
- 06Binary CountingHow lamps count 0–15 · 7 minPRO
- 07The Ripple CounterFlip-flops that toggle each other · 7 minPRO
- 08Clocks & TimingKeeping everything in step · 6 minPRO
World 4 · Build Projects
PROAssemble real machines from the gates you know- 01From Gates to MachinesHow the projects fit together · 5 minPRO
- 02Project: Majority VoteOutput 1 when 2 of 3 agree · 9 minPRO
- 03Project: 4-bit AdderChain four full adders · 12 minPRO
- 04Project: Binary → DecimalDecode 4 bits to a digit · 8 minPRO
- 05Project: Traffic LightA state machine in gates · 10 minPRO
- 06Project: 1-bit ALUAdd or AND, chosen by a control bit · 11 minPRO
- 07Project: Parity CheckerError detection with XOR · 7 minPRO
- 08Where Logic Goes NextFrom gates to CPUs and code · 5 minPRO
World 5 · Algorithms Visualized
PROSorting, graph search, trees, and from gates to a CPU- 01Sorting race: insertion vs mergeCounting comparisons, n² against n·log n · 10 minPRO
- 02Shortest path: BFS vs DFSBreadth first finds the shortest route; depth first may not · 10 minPRO
- 03Build the shortest search treeInsertion order decides a binary search tree’s height · 10 minPRO
- 04From gates to a CPU: run 3 + 4Fetch, decode, execute on a 4-instruction toy CPU · 10 minPRO
Read first
All guides →Guides for Logic Gates
ExplainerLogic GatesLogic Gates Explained: AND, OR, NOT, XOR and NANDHow logic gates turn 1s and 0s into decisions, how to read truth tables, why NAND can build every other gate, and how De Morgan's laws connect them.
ExplainerAI LabWhat Is an Artificial Neuron? Weights, Bias, ActivationA single artificial neuron takes numbers in and gives one number out. See how weights, bias and activation work and how a neuron draws a decision line.