Question

1. Assume we are using the simple model for floating-point representation as given in this book (the representation uses a 14
0 0
Add a comment Improve this question Transcribed image text
Answer #1

a)

The representation of 100.0 in the floating-point representation is computed as follows:

First convert the given number 100.0 in the binary form.

10010 = 11001002

Therefore, the binary representation of 100.0 is 1100100.

Now, convert the binary number to the power of 2.

1100100.0 = 0.1100100 * 27

Therefore, the value of the exponent is 7.

After the above process, convert the exponent into 15 bits excess. Add 15 in 7, 15 + 7 = 22.

222 = 101102

Hence, the 14-bit floating point representation of 100.0 is given as follows:

Sign bit = 0

Exponent (5 bits) = 10110

Significant bits of 8 = 11001000

0 1 0 1 1 0 1 1 0 0 1 0 0 0

The representation of 0.25 in the floating-point representation is computed as follows:

First convert the given number 0.25 in the binary form.

0.2510 = 0.012

Therefore, the binary representation of 0.25 is 0.01.

Now, convert the binary number to the power of 2.

0.01 = 0.1 * 2-1

Therefore, the value of the exponent is -1.

After the above process, convert the exponent into 15 bits excess. Add 15 in -1, 15 - 1 = 14.

142 = 011102

Hence, the 14-bit floating point representation of 0.25 is given as follows:

Sign bit = 0

Exponent (5 bits) = 01110

Significant bits of 8 = 10000000

0 0 1 1 1 0 1 0 0 0 0 0 0 0

b)

The addition of the floating-point numbers is computed as follows:

100.0 = .11001000 * 27

0.25 = .1 * 2-1

The 0.25 can also be represented as 0.000000001 * 27

.11001000 × 27

+ .000000001 × 27

.110010001 × 27

Thus, the addition of the two floating-point numbers is 110010001 * 27.

c)

The decimal representation of the obtained sum is computed as follows:

Since, the sign bit would be 0 because the sum obtained is also positive.

The value of the exponent is 7.

Convert the exponent to the 15-bit excess by adding 15 into 7. So, 15 + 7 = 22.

The binary representation of 22 is 10110.

The significant bits are 11001000.

Therefore, the 14-bit floating point representation is shown below:

0 1 0 1 1 0 1 1 0 0 1 0 0 0

.11000100*27=1100100

Hence, the decimal representation of the sum obtained is 100.

thank you hope you understand easily............

if we like the answer plz vote up

Add a comment
Know the answer?
Add Answer to:
1. Assume we are using the simple model for floating-point representation as given in this book...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 2. Perform the following binary multiplications, assuming unsigned integers: B. 10011 x 011 C. 11010 x...

    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 ):...

  • Assume a 10-bit floating point representation format where the Exponent Field has 4 bits

    Assume a 10-bit floating point representation format where the Exponent Field has 4 bits and the Fraction Field has 6 bits and the sign bit field uses 1 bit  S      Exponent Field: 4 bits       Fraction Fleld: 5 bits a) What is the representation of -8.80158 × 10-2 in this Format - assume bias =2M-1-1=24-1-1=7 (where N= number of exponent field bits) for normalized representation 1 -bias =-6 : for denormalized representationb) What is the range of representation for...

  • Only Answer Part D! Thanks Floating Point Representation Consider a computer that stores information using 10...

    Only Answer Part D! Thanks Floating Point Representation Consider a computer that stores information using 10 bits words. The first bit is for the sign of the number, the next 5 for the sign and magnitude of the exponent and the last 4 for the magnitude of the mantissa. The mantissa is normalized as described in class and in the textbook. a. Convert 1 00010 1001 to a base-10 system b. What is the highest number that can be stored...

  • Floating Point Representation Consider a computer that stores information using 10 bits words. The first bit...

    Floating Point Representation Consider a computer that stores information using 10 bits words. The first bit is for the sign of the number, the next 5 for the sign and magnitude of the exponent and the last 4 for the magnitude of the mantissa. The mantissa is normalized as described in class and in the textbook. a. Convert 1 00010 1001 to a base-10 system b. What is the highest number that can be stored on this computer? c. What...

  • If we use the IEEE standard floating-point single-precision representation (1 sign bit, 8 bit exponent bits...

    If we use the IEEE standard floating-point single-precision representation (1 sign bit, 8 bit exponent bits using excess-127 representation, 23 significand bits with implied bit), then which of the following hexadecimal number is equal to the decimal value 3.875? C0780000 40007800 Oo 40780000 40A80010 The binary string 01001001110000 is a floating-point number expressed using a simplified 14-bit floating-point representation format (1 sign bit, 5 exponent bits using excess-15 representation, and 8 significand bits with no implied bit). What is its...

  • Assume the following representation for a floating point number 1 sign bit

     Assume the following representation for a floating point number 1 sign bit, 4 bits exponent, 5 bits for the significand, and a bias of 7 for the exponent (there is no implied 1 as in IEEE). a) What is the largest number (in binary) that can be stored? Estimate it in decimal. b) What is the smallest positive number( closest to 0 ) that can be stored in binary? Estimate it in decimal.c) Describe the steps for adding two floating point numbers. d)...

  • I would like a step by step explanation as to how the 7-bit floating point representations...

    I would like a step by step explanation as to how the 7-bit floating point representations from Format A were converted to Format B. Thanks. Consider the following two 7-bit floating point representations based on the IEEE floating point format. Neither has a sign bit - they can only represent non-negative numbers. i). Format A. There are k=3 exponent bits. The exponent bias is 3. There are n=4 fraction bits. ii). Format B. There are k=4 exponent bits. The exponent...

  • Consider the following two 16-bit floating-point representations 1. Format A. There is one sign b...

    Please show work, thanks. Consider the following two 16-bit floating-point representations 1. Format A. There is one sign bit There are k 6 exponent bits. The exponent bias is 31 (011111) There are n 9 fraction/mantissa bits 2. Format B There is one sign bit There are k 5 exponent bits. The exponent bias is 15 (01111) There are n 10 fraction/mantissa bits Problem 1 (81 points total /3 points per blank) Below, you are given some bit patterns in...

  • What would be the IEEE 754 double precision floating point representation of 1.32487359893280124981233898124124 times 10^-17. For...

    What would be the IEEE 754 double precision floating point representation of 1.32487359893280124981233898124124 times 10^-17. For explanation, I want you to document the steps you perform, in this order: (1) What is n in decimal fixed point form (ddd.ddd,dd); (2) What is n in binary fixed point form (bbb.bbbb), storing the first 110 bits following the binary point); (3) What is the normalized binary number, written in the form 1.bbbbb...bbb times 2^e, storing 54 bits following the binary point) (4)...

  • I would like a step by step explanation as to how the 7-bit floating point representations from Format A were converted...

    I would like a step by step explanation as to how the 7-bit floating point representations from Format A were converted to Format B. Thanks. Consider the following two 7-bit floating point representations based on the IEEE floating point format. Neither has a sign bit - they can only represent non-negative numbers. i). Format A. There are k=3 exponent bits. The exponent bias is 3. There are n=4 fraction bits. ii). Format B. There are k=4 exponent bits. The exponent...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT