Question

PART C: Data Representation in Computer Systems (28 Marks) 1. Convert (-204710) into a 32 bit two's complement binary number. [4] 2. Perform (3010 - 4010) arithmetic operations using 8 bit two's complement.[6] 3. Show IEEE 754 binary representation for (20.510) floating point numbers in single precision. (follow the all steps to show your answer) [8] Sign (1 bit) Exponent (8 bits) Fraction (23 bits) 4. Create the table list for 1st version of Multiplication Hardware Algorithm for (910 x 1210) using 4 bits. Use the pseudo code and table format as displayed below. [10] Iteration Step Multiplier (MP) Multiplicand (MC) Product (P) 0 Initial value 1100 0000 1001 0000 0000 Steps: 1-Test LSB of multiplier (0 or 1) If 1 then 1a: P = P + MC If 0 then no operation 2-Shift MC left 3-Shift MP right All bits done? If still <max bit, repeat If = max bit, stop

          PART C: Data Representation in Computer Systems (28 Marks)
1. Convert (-2047<sub>10</sub>) into a 32 bit two's complement binary number. [4]
2. Perform (30<sub>10</sub> - 40<sub>10</sub>) arithmetic operations using 8 bit two's complement.[6]
3. Show IEEE 754 binary representation for (20.5<sub>10</sub>) floating point numbers in single
precision. (follow the all steps to show your answer) [8]
Sign (1 bit)	Exponent (8 bits)	Fraction (23 bits)
4. Create the table list for 1<sup>st</sup> version of Multiplication Hardware Algorithm for (9<sub>10</sub> x
12<sub>10</sub>) using 4 bits. Use the pseudo code and table format as displayed below. [10]
Iteration	Step	Multiplier
(MP)	Multiplicand
(MC)	Product
(P)
0	Initial value	1100	0000 1001	0000 0000
Steps:
1-Test LSB of multiplier (0 or 1)
If 1 then 1a: P = P + MC
If 0 then no operation
2-Shift MC left
3-Shift MP right
All bits done?
If still <max bit, repeat
If = max bit, stop

PART C: Data Representation in Computer Systems (28 Marks)
1. Convert (-2047<sub>10</sub>) into a 32 bit two's complement binary number. [4]
2. Perform (30<sub>10</sub> - 40<sub>10</sub>) arithmetic operations using 8 bit two's complement.[6]
3. Show IEEE 754 binary representation for (20.5<sub>10</sub>) floating point numbers in single
precision. (follow the all steps to show your answer) [8]
Sign (1 bit) Exponent (8 bits) Fraction (23 bits)
4. Create the table list for 1<sup>st</sup> version of Multiplication Hardware Algorithm for (9<sub>10</sub> x
12<sub>10</sub>) using 4 bits. Use the pseudo code and table format as displayed below. [10]
Iteration Step Multiplier
(MP) Multiplicand
(MC) Product
(P)
0 Initial value 1100 0000 1001 0000 0000
Steps:
1-Test LSB of multiplier (0 or 1)
If 1 then 1a: P = P + MC
If 0 then no operation
2-Shift MC left
3-Shift MP right
All bits done?
If still <max bit, repeat
If = max bit, stop

Added by Fred T.

Question

Please give Ace some feedback