What you'll learn
34 lessons in Boolean algebra & logic
Boolean operations & lawsTruth tables & expressionsLogic gatesKarnaugh mapsSequential circuits & flip-flopsHalf/full addersQuine-McCluskey minimizationMultiplexers, decoders, encodersFinite state machinesALU designBinary decision diagrams (BDDs)SAT solvers & DPLLModal & temporal logicBoolean satisfiability variantsProof: NAND is universalProof: XOR cannot be 2-level OR-of-ANDs without negationCombinational vs sequential designFirst-order logic & resolutionShannon expansion & cofactorsFunctional completeness & Post's theoremAlgebraic normal form (Reed–Muller)Threshold logic & linear separabilityMonotone & symmetric functionsTwo's complement & binary arithmeticGray codesHazards in combinational circuitsFourier analysis of Boolean functionsSensitivity & decision-tree complexityCircuit size, depth & lower boundsNonlinearity & bent functionsHamming distance & error-correcting codesLinear feedback shift registersCarry-lookahead & fast addersReversible & Toffoli gates