
a)
Explanation of Solution
IEEE-754 floating point double precision:
IEE-754 floating point double precision has 64 bits.
- One bit for sign, 11 bits for exponent, and 52 bits for significant bits.
Storing “12.5” using IEEE-754 double 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”.
Step (v): Note the integer part to get the final result.
Thus the binary equivalent for “12.5” is
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.
Step 3: Convert the exponent to 11 bit excess-1023:
To convert the exponent into 8-bit excess-1023 notation, the exponent value should be added with 127. After addition, it is converted into binary equivalent.
Converting
Step 4: Convert the significant to hidden bit:
To convert the significant to hidden bit the leftmost “1” should be removed.
Step 5: Framing the number “12.5” in 64 bit IEEE-754 double precision
Sign bit(1 bit) | Exponent bit(11 bits) | Significant bit(52) |
0 | 10000000010 | 1001000000000000000000000000000000000000000000000000 |
Thus, the number “12.5” in 64 bit IEEE-754 double precision is represented as “
b)
Explanation of Solution
Storing “-1.5” using IEEE-754 double 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”.
Step (ii): Note the integer part to get the final result.
Thus the binary equivalent for “1.5” is
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.
Step 3: Convert the exponent to 11 bit excess-1023:
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.
Converting
Step 4: Convert the significant to hidden bit:
To convert the significant to hidden bit the leftmost “1” should be removed.
Step 5: Framing the number “-1.5” in 64 bit IEEE-754 double precision
Sign bit(1 bit) | Exponent bit(11 bits) | Significant bit(52) |
1 | 01111111111 | 1000000000000000000000000000000000000000000000000000 |
Thus, the number “-1.5” in 64 bit IEEE-754 double precision is represented as “
c)
Explanation of Solution
Storing “.75” using IEEE-754 double 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”.
Step (ii): Note the integer part to get the final result.
Thus the binary equivalent for “.75” is
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.
Step 3: Convert the exponent to 11 bit excess-1023:
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.
Converting
Step 4: Convert the significant to hidden bit:
To convert the significant to hidden bit the leftmost “1” should be removed.
Step 5: Framing the number “.75” in 64 bit IEEE-754 single precision
Sign bit(1 bit) | Exponent bit(11 bits) | Significant bit(52) |
0 | 01111111110 | 10000000000000000000000 |
Thus, the number “.75” in 64 bit IEEE-754 double precision is represented as “
d)
Explanation of Solution
Storing “26.625” using IEEE-754 double 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”.
Step (v): Note the integer part to get the final result.
Thus the binary equivalent for “26.625” is
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.
Step 3: Convert the exponent to 11 bit excess-1023:
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.
Converting
Step 4: Convert the significant to hidden bit:
To convert the significant to hidden bit the leftmost “1” should be removed.
Step 5: Framing the number “26.625” in 64 bit IEEE-754 double precision
Sign bit(1 bit) | Exponent bit(11 bits) | Significant bit(52) |
0 | 10000000011 | 101010100000000000000000000000000000000000000000000 |
Thus, the number “12.5” in 64 bit IEEE-754 double precision is represented as “
Want to see more full solutions like this?
Chapter 2 Solutions
The Essentials of Computer Organization and Architecture
- Q2) by using SHI-Tomasi detector method under the constraints shown in fig. 1 below find the corner that is usful to use in video-steganography? 10.8 ...... V...... 0.7 286 720 ke Fig.1 Threshold graph. The plain test is :Hello Ahmed the key is: 3a 2x5 5b 7c 1J 55 44 2X3 [ ] 2x3arrow_forwardusing r languagearrow_forwardWhat disadvantages are there in implicit dereferencing of pointers, but only in certain contexts?arrow_forward
- using r languagearrow_forwardWhat significant justification is there for the -> operator in C and C++?arrow_forwardMultidimensional arrays can be stored in row major order, as in C++, or in column major order, as in Fortran. Develop the access functions for both of these arrangements for three-dimensional arrays.arrow_forward
- What are the arguments for and against Java’s implicit heap storage recovery, when compared with the explicit heap storage recovery required in C++? Consider real-time systems.arrow_forward8. Name and Email AddressesWrite a program that keeps names and email addresses in a dictionary as key-value pairs. The program should display a menu that lets the user look up a person’s email address, add a new name and email address, change an existing email address, and delete an existing name and email address. The program should pickle the dictionary and save it to a file when the user exits the program. Each time the program starts, it should retrieve the dictionary from the file and unpickle it. How would the user be able to use the program?arrow_forwardPlease solve and answer the question correctly please. Thank you!!arrow_forward
- Please solve and answer the question correctly please. Thank you!!arrow_forwardW AutoSave Off File Home Insert Draw Design Assignment_1[1] - Protected... ■ Saved V > Search Layout References Mailings Review View Help QuillBot RefWorks - RCM PROTECTED VIEW Be careful-files from the Internet can contain viruses. Unless you need to edit, it's safer to stay in Protected View. Enable Editing PR Comments Viewing Share × 2. The following state transition table is a simplified model of process management, with the labels representing transitions between states of READY, RUN, BLOCKED, and NONRESIDENT. READY RUN BLOCKED NONRESIDENT READY RUN - 1 - 5 BLOCKED 2 4 3 - 6 Give an example of an event that can cause each of the above transitions. Draw a diagram if that helps. (5) Page 2 of 4 20 of 278 words Text Predictions: On 64 f W Focus + 170% ENG US 17:13 2025/03/24arrow_forwardI need help understanding how could I got the IP Address for the Last Host on this Subnet & the Broadcast Address for this Subnetarrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





