Fill in the blanksQuestion 1 · Recall
Loading…
By the end you can construct truth tables for NOT, AND, OR, NAND, NOR and XOR.
A truth table lists every input combination once. For two inputs, count in binary: 00, 01, 10, 11.
For example, row 10 means A=1 and B=0, so an AND gate outputs 0.
Keep this row order consistent, then apply one gate rule to each row. No guessing and no missing combinations.
Worked example: Build AND one row at a time
Complete the output column for an AND gate with inputs A and B.