Level/Full Adder: Difference between revisions

From Turing Complete
VisualWikitext
(Created a page showing a possible solution to the FULL ADDER level.)
 
(Added infobox)
 
Line 1: Line 1:
{{Header Nav}}
{{Header Nav}}
{{Infobox level
| section            = Arithmetic
| type                = Component
| prerequisite1      = Half Adder
| unlocks-level1      = Adding Bytes
| unlocks-component1  = Full Adder
| unlocks-page1      = <!-- Which manual page is unlocked -->
| unlocks-feature1    = <!-- Which feature is unlocked -->
| scored              = Yes
| highscore          = 15
| api-enum-id        = full_adder
| api-enum-number    = 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.
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|frame|Full Adder Component|center]]
[[File:Full Adder Solution.png|frame|Full Adder Solution|center]]
{| class="wikitable"
{| class="truthtable"
|+Truth Table for the Full Adder
|+Truth Table for the Full Adder
!Input 1
!Input 1!!Input 2!!Input 3!!Output!!Carry
!Input 2
!Input 3
!Output
!Carry
|-
|-
|0
|{{Off_t}}||{{Off_t}}||{{Off_t}}||{{Off_t}}||{{Off_t}}
|0
|0
|0
|0
|-
|-
|1
|{{On_t}}||{{Off_t}}||{{Off_t}}||{{On_t}}||{{Off_t}}
|0
|0
|1
|0
|-
|-
|0
|{{Off_t}}||{{On_t}}||{{Off_t}}||{{On_t}}||{{Off_t}}
|1
|0
|1
|0
|-
|-
|1
|{{On_t}}||{{On_t}}||{{Off_t}}||{{Off_t}}||{{On_t}}
|1
|0
|0
|1
|-
|-
|0
|{{Off_t}}||{{Off_t}}||{{On_t}}||{{On_t}}||{{Off_t}}
|0
|1
|1
|0
|-
|-
|1
|{{On_t}}||{{Off_t}}||{{On_t}}||{{Off_t}}||{{On_t}}
|0
|1
|0
|1
|-
|-
|0
|{{Off_t}}||{{On_t}}||{{On_t}}||{{Off_t}}||{{On_t}}
|1
|1
|0
|1
|-
|-
|1
|{{On_t}}||{{On_t}}||{{On_t}}||{{On_t}}||{{On_t}}
|1
|1
|1
|
|}
|}
{{Footer Nav|game=Turing Complete|nextpage=Odd Ticks|prevpage=Half Adder}}
{{Footer Nav|game=Turing Complete|nextpage=Odd Ticks|prevpage=Half Adder}}

Latest revision as of 14:36, 23 August 2024

Main Page | Table of Contents | Gameplay | Walkthrough

Table of Contents

Table of Contents
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.

Full Adder Solution
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 1
Go to top
← Half Adder | Full Adder | Odd Ticks →

Table of Contents

Table of Contents
Retrieved from "http://turingcomplete.wiki/w/index.php?title=Level/Full_Adder&oldid=8930"