EBK ESSENTIALS OF COMPUTER ORGANIZATION
EBK ESSENTIALS OF COMPUTER ORGANIZATION
5th Edition
ISBN: 9781284168549
Author: NULL
Publisher: JONES+BARTLETT LEARNING,LLC (CC)
Expert Solution & Answer
Book Icon
Chapter 2, Problem 51E

a)

Explanation of Solution

IEEE-754 floating point single precision:

IEE-754 floating point single precision has 32 bits.

  • One bit for sign, 8 bits for exponent, and 23 bits for significant bits.

Storing “12.5” using IEEE-754 single precision:

Step 1: Converting decimal to binary number:

Step (i): Divide the given number into two parts, integer and the fractional part. Here, the integer part is “12” and the fractional part is “.5”.

Step (ii): Divide “12” by 2 till the quotient becomes 1. Simultaneously, note the remainder for every division operation.

Step (iii): Note the remainder from the bottom to top to get the binary equivalent.

Step (iv): Consider the fraction part “.5”. Multiply the fractional part “.5” by 2 and it continues till the fraction part reaches “0”.

0.5×2=1.0

Step (v): Note the integer part to get the final result.

Thus, the binary equivalent for “12.5” is 1100.1

Step 2: Normalize the binary fraction number:

Now the given binary fraction number should be normalized. To normalize the value, move the decimal point either right or left so that only single digit will be left before the decimal point.

1100.11.1001×23

Step 3: Convert the exponent to 8 bit excess-127:

To convert the exponent into 8-bit excess-127 notation, the exponent value should be added with 127. After addition, it is converted into binary equivalent.

127+3=130

Converting 13010=100000102

Step 4: Convert the significant to hidden bit:

To convert the significant to hidden bit the leftmost “1” should be removed.

1.10011001

Step 5: Framing the number “12.5” in 32 bit IEEE-754 single precision

Sign bit(1 bit)Exponent bit(8 bits)Significant bit(23)
01000001010010000000000000000000

Thus, the number “12.5” in 32 bit IEEE-754 single precision is represented as “01000001010010000000000000000000”.

b)

Explanation of Solution

Storing “-1.5” using IEEE-754 single precision:

Step 1: Converting decimal to binary number:

Step (i): Consider the fraction part “0.5”. Multiply the fractional part “.5” by 2 and it continues till the fraction part reaches “0”.

0.5×2=1.0

Step (ii): Note the integer part to get the final result.

Thus the binary equivalent for “1.5” is 1.1

Step 2: Normalize the binary fraction number:

Now the given binary fraction number should be normalized. To normalize the value, move the decimal point either right or left so that only single digit will be left before the decimal point.

1.11.1×20

Step 3: Convert the exponent to 8 bit excess-127:

To convert the exponent into 8-bit excess-127 notation, the exponent value should be added with 127. After addition, it is converted into binary equivalent.

127+0=127

Converting 12710=011111112

Step 4: Convert the significant to hidden bit:

To convert the significant to hidden bit the leftmost “1” should be removed.

1.11

Step 5: Framing the number “-1.5” in 32 bit IEEE-754 single precision

Sign bit(1 bit)Exponent bit(8 bits)Significant bit(23)
10111111110000000000000000000000

Thus, the number “-1.5” in 32 bit IEEE-754 single precision is represented as “10111111110000000000000000000000”.

c)

Explanation of Solution

Storing “.75” using IEEE-754 single precision:

Step 1: Converting decimal to binary number:

Step (i): Consider the fraction part “.75”. Multiply the fractional part “.75” by 2 and it continues till the fraction part reaches “0”.

0.75×2=1.5010.50×2=1.001

Step (ii): Note the integer part to get the final result.

0.7510=0.112

Thus the binary equivalent for “.75” is 0.112

Step 2: Normalize the binary fraction number:

Now the given binary fraction number should be normalized. To normalize the value, move the decimal point either right or left so that only single digit will be left before the decimal point.

.111.1×21

Step 3: Convert the exponent to 8 bit excess-127:

To convert the exponent into 8-bit excess-127 notation, the exponent value should be added with 127. After addition, it is converted into binary equivalent.

127+(1)=126

Converting 12610=011111102

Step 4: Convert the significant to hidden bit:

To convert the significant to hidden bit the leftmost “1” should be removed.

1.11

Step 5: Framing the number “.75” in 32 bit IEEE-754 single precision

Sign bit(1 bit)Exponent bit(8 bits)Significant bit(23)
00111111010000000000000000000000

Thus, the number “.75” in 32 bit IEEE-754 single precision is represented as “10111111010000000000000000000000”.

d)

Explanation of Solution

IEEE-754 floating point single precision:

IEE-754 floating point single precision has 32 bits.

  • One bit for sign, 8 bits for exponent, and 23 bits for significant bits.

Storing “26.625” using IEEE-754 single precision:

Step 1: Converting decimal to binary number:

Step (i): Divide the given number into two parts, integer and the fractional part. Here, the integer part is “26” and the fractional part is “.625”.

Step (ii): Divide “26” by 2 till the quotient becomes 1. Simultaneously, note the remainder for every division operation.

Step (iii): Note the remainder from the bottom to top to get the binary equivalent.

Step (iv): Consider the fraction part “.5”. Multiply the fractional part “.625” by 2 and it continues till the fraction part reaches “0”.

0.625×2=1.2510.25×2=0.5000.50×2=1.001

Step (v): Note the integer part to get the final result.

0.62510=0.1012

Thus the binary equivalent for “26.625” is 11010.1012

Step 2: Normalize the binary fraction number:

Now the given binary fraction number should be normalized. To normalize the value, move the decimal point either right or left so that only single digit will be left before the decimal point.

11010.1011.1010101×24

Step 3: Convert the exponent to 8 bit excess-127:

To convert the exponent into 8-bit excess-127 notation, the exponent value should be added with 127. After addition, it is converted into binary equivalent.

127+4=131

Converting 13110=100000112

Step 4: Convert the significant to hidden bit:

To convert the significant to hidden bit the leftmost “1” should be removed.

1.10101011010101

Step 5: Framing the number “26.625” in 32 bit IEEE-754 single precision

Sign bit(1 bit)Exponent bit(8 bits)Significant bit(23)
01000001110101010000000000000000

Thus, the number “12.5” in 32 bit IEEE-754 single precision is represented as “01000001110101010000000000000000”.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Chapter 2 Solutions

EBK ESSENTIALS OF COMPUTER ORGANIZATION

Ch. 2 - Prob. 11RETCCh. 2 - Prob. 12RETCCh. 2 - Prob. 13RETCCh. 2 - Prob. 14RETCCh. 2 - Prob. 15RETCCh. 2 - Prob. 16RETCCh. 2 - Prob. 17RETCCh. 2 - Prob. 18RETCCh. 2 - Prob. 19RETCCh. 2 - Prob. 20RETCCh. 2 - Prob. 21RETCCh. 2 - Prob. 22RETCCh. 2 - Prob. 23RETCCh. 2 - Prob. 24RETCCh. 2 - Prob. 25RETCCh. 2 - Prob. 26RETCCh. 2 - Prob. 27RETCCh. 2 - Prob. 28RETCCh. 2 - Prob. 29RETCCh. 2 - Prob. 30RETCCh. 2 - Prob. 31RETCCh. 2 - Prob. 32RETCCh. 2 - Prob. 33RETCCh. 2 - Prob. 34RETCCh. 2 - Prob. 1ECh. 2 - Prob. 2ECh. 2 - Prob. 3ECh. 2 - Prob. 4ECh. 2 - Prob. 5ECh. 2 - Prob. 6ECh. 2 - Prob. 7ECh. 2 - Prob. 8ECh. 2 - Prob. 9ECh. 2 - Prob. 10ECh. 2 - Prob. 11ECh. 2 - Prob. 12ECh. 2 - Prob. 13ECh. 2 - Prob. 14ECh. 2 - Prob. 15ECh. 2 - Prob. 16ECh. 2 - Prob. 17ECh. 2 - Prob. 18ECh. 2 - Prob. 19ECh. 2 - Prob. 20ECh. 2 - Prob. 21ECh. 2 - Prob. 22ECh. 2 - Prob. 23ECh. 2 - Prob. 24ECh. 2 - Prob. 25ECh. 2 - Prob. 26ECh. 2 - Prob. 27ECh. 2 - Prob. 29ECh. 2 - Prob. 30ECh. 2 - Prob. 31ECh. 2 - Prob. 32ECh. 2 - Prob. 33ECh. 2 - Prob. 34ECh. 2 - Prob. 35ECh. 2 - Prob. 36ECh. 2 - Prob. 37ECh. 2 - Prob. 38ECh. 2 - Prob. 39ECh. 2 - Prob. 40ECh. 2 - Prob. 41ECh. 2 - Prob. 42ECh. 2 - Prob. 43ECh. 2 - Prob. 44ECh. 2 - Prob. 45ECh. 2 - Prob. 46ECh. 2 - Prob. 47ECh. 2 - Prob. 48ECh. 2 - Prob. 49ECh. 2 - Prob. 50ECh. 2 - Prob. 51ECh. 2 - Prob. 52ECh. 2 - Prob. 53ECh. 2 - Prob. 54ECh. 2 - Prob. 55ECh. 2 - Prob. 56ECh. 2 - Prob. 57ECh. 2 - Prob. 58ECh. 2 - Prob. 59ECh. 2 - Prob. 60ECh. 2 - Prob. 61ECh. 2 - Prob. 62ECh. 2 - Prob. 63ECh. 2 - Prob. 64ECh. 2 - Prob. 65ECh. 2 - Prob. 66ECh. 2 - Prob. 67ECh. 2 - Prob. 68ECh. 2 - Prob. 69ECh. 2 - Prob. 70ECh. 2 - Prob. 71ECh. 2 - Prob. 72ECh. 2 - Prob. 73ECh. 2 - Prob. 74ECh. 2 - Prob. 75ECh. 2 - Prob. 76ECh. 2 - Prob. 77ECh. 2 - Prob. 78ECh. 2 - Prob. 79ECh. 2 - Prob. 80ECh. 2 - Prob. 81ECh. 2 - Prob. 82E
Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education