![Essentials of Computer Organization and Architecture](https://www.bartleby.com/isbn_cover_images/9781284123036/9781284123036_largeCoverImage.gif)
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”.
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 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.
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 32 bit IEEE-754 single precision
Sign bit(1 bit) | Exponent bit(8 bits) | Significant bit(23) |
0 | 10000010 | 10010000000000000000000 |
Thus, the number “12.5” in 32 bit IEEE-754 single precision is represented as “
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”.
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 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.
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 32 bit IEEE-754 single precision
Sign bit(1 bit) | Exponent bit(8 bits) | Significant bit(23) |
1 | 01111111 | 10000000000000000000000 |
Thus, the number “-1.5” in 32 bit IEEE-754 single precision is represented as “
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”.
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 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.
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 32 bit IEEE-754 single precision
Sign bit(1 bit) | Exponent bit(8 bits) | Significant bit(23) |
0 | 01111110 | 10000000000000000000000 |
Thus, the number “.75” in 32 bit IEEE-754 single precision is represented as “
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”.
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 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.
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 32 bit IEEE-754 single precision
Sign bit(1 bit) | Exponent bit(8 bits) | Significant bit(23) |
0 | 10000011 | 10101010000000000000000 |
Thus, the number “12.5” in 32 bit IEEE-754 single precision is represented as “
Want to see more full solutions like this?
Chapter 2 Solutions
Essentials of Computer Organization and Architecture
- I want to ask someone who has experiences in writing physics based simulation software. For context I am building a game engine, and want to implement physics simulation. There are a few approaches that I managed to find, but would like to know what are other approaches to doing physics simulation entry points from scenes, would you be able to visually draw me a few approaches (like 3 approaces)? When I say entry point to the actual physics simulation. An example of this is when the user presses the play button in the editor, it starts and initiates the physics system. Applying all of the global physics settings parameters that gets applied to that scene. Here is the use-case, I am looking for. If you have two scenes, and select scene 1. You press the play button. The physics simulation starts. When that physics simulation starts, you are also having to update the physics through some physics dedicated delta time because physics needs to happen faster update frequency. To elaborate,…arrow_forwardI want to ask someone who has experiences in writing physics based simulation software. For context I am building a game engine, and want to implement physics simulation. There are a few approaches that I managed to find, but would like to know what are other approaches to doing physics simulation entry points from scenes, would you be able to visually draw me a few approaches (like 3 approaces)?When I say entry point to the actual physics simulation. An example of this is when the user presses the play button in the editor, it starts and initiates the physics system. Applying all of the global physics settings parameters that gets applied to that scene.Here is the use-case, I am looking for. If you have two scenes, and select scene 1. You press the play button. The physics simulation starts. When that physics simulation starts, you are also having to update the physics through some physics dedicated delta time because physics needs to happen faster update frequency.To elaborate, what…arrow_forwardMale comedians were typically the main/dominant star of television sitcoms made during the FCC licensing freeze. Question 19 options: True False In the episode of The Honeymooners that you watched this week, why did Alice decide to get a job outside of the home? Question 1 options: to earn enough money to buy a mink coat to have something to do while the kids were at school to pay the bills after her husband got laid offarrow_forward
- After the FCC licensing freeze was lifted, sitcoms featuring urban settings and working class characters became far less common. Question 14 options: True Falsearrow_forwardsolve this questions for me .arrow_forwarda) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?arrow_forward
- Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as thearrow_forwardwhats for dinner? pleasearrow_forwardConsider the follow program that prints a page number on the left or right side of a page. Define and use a new function, isEven, that returns a Boolean to make the condition in the if statement easier to understand. ef main() : page = int(input("Enter page number: ")) if page % 2 == 0 : print(page) else : print("%60d" % page) main()arrow_forward
- What is the correct python code for the function def countWords(string) that will return a count of all the words in the string string of workds that are separated by spaces.arrow_forwardConsider the following program that counts the number of spaces in a user-supplied string. Modify the program to define and use a function, countSpaces, instead. def main() : userInput = input("Enter a string: ") spaces = 0 for char in userInput : if char == " " : spaces = spaces + 1 print(spaces) main()arrow_forwardWhat is the python code for the function def readFloat(prompt) that displays the prompt string, followed by a space, reads a floating-point number in, and returns it. Here is a typical usage: salary = readFloat("Please enter your salary:") percentageRaise = readFloat("What percentage raise would you like?")arrow_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
![Text book image](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Text book image](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)