Section | Arithmetic |
---|---|
Type | Component |
Prerequisite | Half Adder |
Unlocks | Adding Bytes |
Full Adder | |
Scored | Yes |
High score | 15 |
API | full_adder (42) |
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.

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 |
![]() 1
|