A half adder and full adder truth table is the basic reference used in digital logic to understand how binary addition works inside computers, microcontrollers, and arithmetic circuits. Even so, a half adder handles two input bits, while a full adder handles three input bits, including a carry from a previous position. For students, the tables are not just memorization tools; they explain how simple logic gates combine to perform arithmetic. These truth tables show every possible combination of input bits and the resulting sum and carry outputs. By studying both truth tables, readers can see why full adders are required for multi-bit addition and how carry propagation creates the foundation of binary arithmetic.
What Is a Half Adder Truth Table?
A half adder is the simplest binary adder. Still, it has two inputs, usually labeled A and B, and two outputs: Sum, often called S, and Carry, often called C. The half adder truth table lists all four possible input combinations and shows what the circuit produces for each case.
| A | B | Sum (S) | Carry (C) |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
The table is easy to understand because it matches basic binary addition. When two zeros are added, the result is zero
