Level/Full Adder

From Turing Complete
Revision as of 17:38, 4 April 2024 by Penguinblaze (talk | contribs) (Created a page showing a possible solution to the FULL ADDER level.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

This level challenges you to construct a full adder circuit combining two input bits and a carry bit to produce a sum and a carry-over. Utilize XOR gates for the primary addition, while AND and OR gates manage the carry to showcase the fundamental building block of binary arithmetic.

File:Component Full Adder.png
Full Adder Component
Truth Table for the Full Adder
Input 1 Input 2 Input 3 Output Carry
0 0 0 0 0
1 0 0 1 0
0 1 0 1 0
1 1 0 0 1
0 0 1 1 0
1 0 1 0 1
0 1 1 0 1
1 1 1 1