1) An unsigned integer x is represented by x mod 256 in some representation scheme. How many bits are allocated for the unsigned integer in this scheme?

2) Demote the following 8-bit unsigned integers to 4-bit representation. Indicate if chopping is not possible without losing accuracy.

00000001

10000001

00010001

10001010

10000111

3) Demote the following 8-bit unsigned integers to 4-bit representation. Indicate if chopping is not possible without losing accuracy.

00000001

10000001

00010001

10001010

10000111

4) Express the following decimal numbers in 8-bit 2s compliment representation? Indicate if not possible

0	-1	127	128	-128
-129	5	-5	16	-32

5 ) Express the following expressions in 4-bit sign-magnitude format and then calculate the answers. Indicate if overflow.

5 + 2 = 0101 + 0011=	4 + 4	-5 + -2	-4 + -4
5 + -2	4 + -4	-5 + 2	-1 + 1
5 2	4 - 4	-1 - -1	0 - 1

3)

6)Calculate the following in 8-bit sign-magnitude integer representation? Indicate if overflow.

01010101 + 00010001	011111100 + 00001111	10011001 + 10101010	11101110 + 11010101
11101111 + 01110001	11110000 + 00111111	11101111 + 01101111	10000000 + 00000000
01010101 - 00010001	01010101 00110011	11011101 - 10101010	11101110 10101010
11101110 + 01110111	11111111 01110111	11101110 - 00110011	11111111 10000000