1. Translate each of the following problems from base 10 notation into two’s complement notation using bit patterns of length four, then convert each problem to an equivalent addition problem (as a...

1.
Translate each of the following problems from base 10 notation into two’s complement notation using bit patterns of length four, then convert each problem to an equivalent addition problem (as a machine might do), and perform the addition. Check your answers by converting them back to base 10 notation.

a.
6 - (-1)
b.
3 - (-2)
c.
4 - 6

d.
2 - (-4)
e.
1 - 5

2.
Can overflow ever occur when values are added in two’s complement notation with one value positive and the other negative? Explain your answer.

3.
Convert each of the following excess eight representations to its equivalent base 10 form without referring to the table in the text:

a.
1110
b.
0111
c.
1000

d.
0010
e.
0000
f.
1001