QUESTION 1 We are multiplying 111 1101 and 0000 1110, and are part way through the calculation. Insert the row that is missing and do the next step by filling in the next digit of the result, the next...

Extracted text: QUESTION 1 We are multiplying 111 1101 and 0000 1110, and are part way through the calculation. Insert the row that is missing and do the next step by filling in the next digit of the result, the next carry one over and the next carry two over. 1111 1101 0000 1110 11111 1010 111 1110 1000 0 1000 0000 carries two over 1011 0000 carries one over 101 0110 result 11 1111 0100 1 1111 1010 111 1110 1000


Extracted text: QUESTION 2 We are still multiplying 1111 1101 and 0000 1110, and are part way through the calculation. Complete the calculation by inserting the appropriate bit sequences. 1111 1101 0000 1110 11111 1010 11 1111 0100 111 1110 1000 0 1000 0000 carries two over 1011 0000 carries one over 101 0110 result 101 0010 11011 100 0011 1101 0 QUESTION 3 Compare eight-bit unsigned integers with eight-bit two's complement: Property Unsigned Signed How many numbers represented Largest positive Largest positive number bit pattern Smallest (or most negative) Smallest number bit pattern 256 255 128 127 1111 1111|| 01ll 1111 -128 0000 0000 1000 0000 1111 1111