1. Convert -2047ten into 32-bit 2s complement

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

2. Given the pattern 1010 1101 0001 0000 0000 0000 0000 0010 what does it represent if it is a) a twos complement integer b) an unsigned integer

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

3. Using the simple multiplication algorithm where we store multiplier in the right half of result register and shift right in each cycle (add multiplicand if the least significant bit of multiplier is 1, or add zero otherwise), perform the following multiplication X*Y

x = -6 = 1111 1010

y = +5 = 0000 0101

Note one of the number is negative, so you will need to takes 2s complement, and multiply only positive numbers. But since the result is negative, you need to complement the result.

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

4. Using restoring division divide 112 by 7. Assume each number is 8-bits long. You need to repeat the process of subtracting (and possibly restoring) and shift left 9 times. The quotient will be in the right half of the result register while the remainder should be in the left half (you need to shift the left half one position to the right to get the correct remainder.