Problem Set Answers: Two's Complement
- Convert the following decimal numbers to 12 bit 2's complement:
- 10110 = 0000 0110 01012c12
- -9710 = 1111 1001 11112c12
- 62010 = 0010 0110 11002c12
- -18710 = 1111 0100 01012c12
- -33210 = 1110 1011 01002c12
- Convert the following 12 bit 2's complement numbers to base 10:
- 0000 1011 10112c12 = 18710
- 1111 1100 01112c12 = -5710
- 0100 0000 00012c12 = 102510
- 1100 0001 11012c12 = -99510
- 0111 1111 11112c12 = 204710
- 1111 1111 11112c12 = -110
- 1000 0000 00002c12 = -204810
- Perform the following additions and subtractions. Assume that
all numbers are in 8 bit 2's complement.
- 10110101 + 11101011 = 1010 0000
neg + neg = neg, no overflow
- 01100001 + 01010101 = 1011 0110
pos + pos = neg, overflow
- 00010110 + 11010110 = 1110 1100
pos + neg = neg, no overflow
- 00011101 + 01011010 = 0111 0111
pos + pos = pos, no overflow
- 10001111 - 11101101 = 1010 0010
neg - neg = neg + pos = neg, no overflow
- 00101101 - 00011011 = 0001 0010
pos - pos = pos + neg = pos, no overflow
- 00011001 - 11011000 = 0100 0001
pos - neg = pos + pos = pos, no overflow
- 10001110 - 01101010 = 00100100
neg - pos = neg + neg = pos, overflow
- Perform the following additions and subtractions. Assume that
all numbers are in 32 bit 2's complement.
State the sign of each number, the sign of the answer,
and whether an overflow occurs.
- 00 00 04 C8 + 48 49 B7 6F = 48 49 BC 37
pos + pos = pos, no overflow
- 00 12 5F 89 + 8F DE 27 83 = 8F F0 87 0C
pos + neg = neg, no overflow
- 39 B4 08 75 + 93 19 76 26 = CC CD 7E 9B
pos + neg = neg, no overflow
- 6A 01 B9 33 + 55 62 09 42 = BF 63 C2 75
pos + pos = neg, overflow
- FF FE 59 00 - 23 45 67 89 =
FF FE 59 00 + DC BA 98 77 = DC B8 F1 77
neg + neg = neg, no overflow
- 49 7B 05 CC - 92 93 8A 6D =
49 7B 05 CC + 6D 6C 75 93 = B6 E7 7B 5F
pos + pos = neg, overflow
- 86 21 4F BC - 6B A4 59 72 =
86 21 4F BC + 94 5B A6 8E = 1A 7C F6 4A
neg + neg = pos, overflow
Email Me |
Office Hours |
My Home Page |
Department Home |
MCC Home Page
© Copyright Emmi Schatz 2011