Question

2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x 1011

3. Perform the following binary divisions, assuming unsigned integers: B. 10000001 / 101 C. 1001010010 / 1011

4. Assume we are using the simple model for floating-point representation as given in the text (the representation uses a 14-bit format, 5 bits for the exponent with a bias of 16, a normalized mantissa of 8 bits, and single sign bit for the number ):

Show how the computer would represent the numbers 100.0 and 0.25 using this flouting-point format. Show how the computer would add the two floating-point numbers in part a by changing one of the one of the numbers so they both expressed using the same power of 2.

Show how the computer would represent the sum in part b using the given floating-point representation. What decimal value for the sum is the computer actually storing? Explain

5. A. Given that ASCII code for A is 1000001, what is ASCII for J? B. Given that the EBCDIC code for A is 1100 0001, what is the EBCDIC code for J? 6. Using the CRC polynomial 1101, compute the CRC code word for the information word, 01001101. Check the division performed at the receiver

Answer 1

In binary multiplication, we only need to remember the following,

0 x 0 = 0
0 x 1 = 0
1 x 0 = 0
1 x 1 = 1

2) B) 10011 x 011

10011

x 011

--------------------

10011

100110 <---- 0 is the placeholder here

0000000   

---------------

111001 <---- Sum of the above 3

----------------

2) C) 11010 x 1011

11010

x 1011

-------------------

11010

110100

0000000

11010000

----------------

100011110