Here are some examples of binary addition.
These are computed without regard to the word
size, hence there can be no sense of "overflow."
Work through the columns right to left, add up the ones and express
the answer in binary. The low bit goes in the sum, and
the high bit carries to the next column left.
• 10001 + 11101
= 101110:
| • 101101 + 11001
= 1000110:
|
• 1011001 + 111010
= 10010011:
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
• 1110 + 1111
= 11101:
| • 10111 + 110101
= 1001100:
|
• 11011 + 1001010
= 1100101:
|
![[^]](http://sandbox.mc.edu/icons/local//up3.gif){kind=icon}