Build truth tables for AND, OR, NOT, XOR, NAND, NOR and compound expressions
A truth table lists every possible combination of inputs (2ⁿ rows for n inputs) and the corresponding output. It is the definitive specification of any combinational logic function.
AND: output 1 only when ALL inputs are 1. OR: output 1 when ANY input is 1. XOR: output 1 when an odd number of inputs are 1. NAND/NOR: AND/OR with inverted output — universal gates.
Each row where output = 1 gives one minterm. Write each minterm as a product (AND) of variables. Sum (OR) all minterms to get the Sum of Products (SOP) expression.