11 - Full Adder

This page was last updated on March 13th, 2020(UTC) and it is currently March 21st, 2023(UTC).
That means this page is 3 years, 8 days, 1 hours, 31 minutes and 27 seconds old. Please keep that in mind.

11 - Full Adder Now, put two together and use an OR gate and you can make a "full-adder."

Machine State: Awaiting initial input...
	128	64	32	16	8	4	2	1
Input A:
Input B:
Output:	□	□	□	□	□	□	□	□
Overflow:	□

Now, imagine you have a black box with 2 rows of 8 switches, the first marked "input A," and the second marked "input B." Below is a figurative machine. The half-adder is attatched to the rightmost switch of inputs A and B, while the output is tied to the rightmost output. The rest of the full-adders are connected similarly heading towards the leftmost inputs and outputs. The final carry from the last full adder is tied to the "overflow" indicator. The checkboxes most likely will not be preserved when you hit the submit button, so you want to either save your predicted answer and/or save what your inputs were.

Get your own web kitty here!
©Copyright 2010-2023. All rights reserved.