1-bit Full Adder
Every arithmetic logic unit chains this single cell to add binary numbers of any width: the carry-out of one stage becomes the carry-in of the next. The full adder takes three 1-bit inputs and produces a sum bit and a carry bit.
Sum is the XOR of all three inputs. Cout is high when two or more inputs are high.
| A | B | Cin | Sum | 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 |
Constraints
- Combinational logic only. No flip-flops, latches, or feedback.
- Use two-input gates only: XOR, AND, OR.
- Reuse the first XOR result for both the
Sumpath and the carry path.
Topics
Solve this problem
Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.
This problem is part of Codiode Pro. The statement above is free to read.
The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.