"how numbers are stored and used in computers"
A half adder is a digital circuit used to perform the addition of two single-bit binary numbers, producing a sum and a carry output.
Click the inputs to change the half adder circuit.
The Half Adder uses an XOR gate to calculate the sum and an AND gate to calculate the carry.
Sum = A ⊕ B (XOR)
Carry = A · B (AND)
The full adder is a digital circuit that computes the sum of three binary inputs: two input bits and an incoming carry bit, producing a sum and a carry output.
Click the inputs to change the full adder circuit.
The Full Adder extends the Half Adder to include a carry input. It uses two half adders and an OR gate.
Sum = A ⊕ B ⊕ Cin (XOR)
Carry = (A · B) + (Cin · (A ⊕ B))
Click on the cells in the Karnaugh map to toggle their values between 0 and 1. The simplified Boolean expression will update accordingly.
| 0 | 1 | |
|---|---|---|
| 0 | 0 | 0 |
| 1 | 0 | 0 |
Click on the cells in the Karnaugh map to toggle their values between 0 and 1. The simplified Boolean expression will update accordingly.
| 0 | 1 | 2 | |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 |
| 2 | 0 | 0 | 0 |
Click on the cells in the Karnaugh map to toggle their values between 0 and 1. The simplified Boolean expression will update accordingly.
| 0 | 1 | 2 | 3 | |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 0 |
| 2 | 0 | 0 | 0 | 0 |
| 3 | 0 | 0 | 0 | 0 |