A Full Adder is a digital logic circuit that adds three one-bit binary numbers, producing a two-bit sum. It consists of:
– Three inputs: A, B, and Carry-in (Cin)
– Two outputs: Sum (S) and Carry-out (Cout)
The Full Adder can be implemented using:
– Half Adders
– Logic gates (AND, OR, XOR)
The truth table for a Full Adder is:
| A | B | Cin | S | Cout |
| — | — | — | — | — |
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |