Full Adder from Half Adders
Arithmetic logic units and digital multipliers rely on chained addition stages to process multi-bit data. The fundamental unit of these chains combines two data bits and an incoming carry bit to produce a sum and an outgoing carry.
Implement full addition logic for inputs A, B, and Cin to produce outputs Sum and Cout according to the following truth table:
| 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
- Construct the circuit using exactly two Half Adder blocks and one OR gate.
- Do not use discrete logic gates to implement the sum or initial carry generation logic.
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.
Free to solve. A Codiode account keeps your progress.
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.