Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 2, Problem 2.86HW
Intel-compatible processors also support an “extended-precision” floating-point format with an 80-bit word divided into a sign bit, k = 15 exponent bits, a single integer bit, and n = 63 fraction bits. The integer bit is an explicit copy of the implied bit in the IEEE floating-point representation. That is, it equals 1 for normalized values and 0 for denormalized values. Fill in the following table giving the approximate values of some “interesting” numbers in this format:
| Extended precision | ||
| Description | Value | Decimal |
| Smallest positive denormalized | _________ | _________ |
| Smallest positive normalized | _________ | _________ |
| Smallest positive normalized | _________ | _________ |
This format can be used in C programs compiled for Intel-compatible machines by declaring the data to be of type long double. However, it forces the compiler to generate code based on the legacy 8087 floating-point instructions. The resulting program will most likely run much slower than would be the case for data type float or double.
Expert Solution & Answer
Trending nowThis is a popular solution!
Learn your wayIncludes step-by-step video
schedule06:05
Students have asked these similar questions
To represent real binary numbers in floating point notation, we use a 14-bit format with 1 bit for the sign, 5 bits for the exponent, and 8 bits for the significand. Assuming an
excess-16 exponent bias, and no implied 1 bit to the left of the radix point, the negative binary (real) number
-0.0000100101
is represented as
O 11010010010100
O 11110010010100
O 10110010010100
O 00110010010100
Assume we are using the simple model for floating-point
representation discussed in the class (the representation uses a 14-
bit format, 5 bits for the exponent with an Excess-M, a significand of
8 bits, and a single sign bit for the number):
Convert 22.375 to the floating-point binary representation.
Your Answer:
Write down the mathematical notation for fixed point representationand floating representation and also explain each term.
Consider the following machine number in 64 bit and Precisely represent the above machine number in decimal digits.
0 10000000011 1011100100010000000000000000000000000000000000000000
Chapter 2 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 2.1 - Practice Problem 2.1 (solution page 143) Perform...Ch. 2.1 - Prob. 2.2PPCh. 2.1 - Prob. 2.3PPCh. 2.1 - Practice Problem 2.4 (solution page 144) Without...Ch. 2.1 - Prob. 2.5PPCh. 2.1 - Prob. 2.6PPCh. 2.1 - Prob. 2.7PPCh. 2.1 - Prob. 2.8PPCh. 2.1 - Practice Problem 2.9 solution page 146 Computers...Ch. 2.1 - Prob. 2.10PP
Ch. 2.1 - Prob. 2.11PPCh. 2.1 - Prob. 2.12PPCh. 2.1 - Prob. 2.13PPCh. 2.1 - Prob. 2.14PPCh. 2.1 - Prob. 2.15PPCh. 2.1 - Prob. 2.16PPCh. 2.2 - Prob. 2.17PPCh. 2.2 - Practice Problem 2.18 (solution page 149) In...Ch. 2.2 - Prob. 2.19PPCh. 2.2 - Prob. 2.20PPCh. 2.2 - Prob. 2.21PPCh. 2.2 - Prob. 2.22PPCh. 2.2 - Prob. 2.23PPCh. 2.2 - Prob. 2.24PPCh. 2.2 - Prob. 2.25PPCh. 2.2 - Practice Problem 2.26 (solution page 151) You are...Ch. 2.3 - Prob. 2.27PPCh. 2.3 - Prob. 2.28PPCh. 2.3 - Prob. 2.29PPCh. 2.3 - Practice Problem 2.30 (solution page 153) Write a...Ch. 2.3 - Prob. 2.31PPCh. 2.3 - Practice Problem 2.32 (solution page 153) You are...Ch. 2.3 - Prob. 2.33PPCh. 2.3 - Prob. 2.34PPCh. 2.3 - Practice Problem 2.35 (solution page 154) You are...Ch. 2.3 - Prob. 2.36PPCh. 2.3 - Practice Problem 2.37 solution page 155 You are...Ch. 2.3 - Prob. 2.38PPCh. 2.3 - Prob. 2.39PPCh. 2.3 - Practice Problem 2.40 (solution page 156) For each...Ch. 2.3 - Prob. 2.41PPCh. 2.3 - Practice Problem 2.42 (solution page 156) Write a...Ch. 2.3 - Practice Problem 2.43 (solution page 157) In the...Ch. 2.3 - Prob. 2.44PPCh. 2.4 - Prob. 2.45PPCh. 2.4 - Prob. 2.46PPCh. 2.4 - Prob. 2.47PPCh. 2.4 - Prob. 2.48PPCh. 2.4 - Prob. 2.49PPCh. 2.4 - Prob. 2.50PPCh. 2.4 - Prob. 2.51PPCh. 2.4 - Prob. 2.52PPCh. 2.4 - Practice Problem 2.53 (solution page 160) Fill in...Ch. 2.4 - Practice Problem 2.54 (solution page 160) Assume...Ch. 2 - Compile and run the sample code that uses...Ch. 2 - Try running the code for show_bytes for different...Ch. 2 - Prob. 2.57HWCh. 2 - Write a procedure is_little_endian that will...Ch. 2 - Prob. 2.59HWCh. 2 - Prob. 2.60HWCh. 2 - Prob. 2.61HWCh. 2 - Write a function int_shifts_are_arithmetic() that...Ch. 2 - Fill in code for the following C functions....Ch. 2 - Write code to implement the following function: /...Ch. 2 - Write code to implement the following function: /...Ch. 2 - Write code to implement the following function: / ...Ch. 2 - You are given the task of writing a procedure...Ch. 2 - Prob. 2.68HWCh. 2 - Write code for a function with the following...Ch. 2 - Write code for the function with the following...Ch. 2 - You just started working for a company that is...Ch. 2 - You are given the task of writing a function that...Ch. 2 - Write code for a function with the following...Ch. 2 - Write a function with the following prototype: /...Ch. 2 - Prob. 2.75HWCh. 2 - The library function calloc has the following...Ch. 2 - Prob. 2.77HWCh. 2 - Write code for a function with the following...Ch. 2 - Prob. 2.79HWCh. 2 - Write code for a function threefourths that, for...Ch. 2 - Prob. 2.81HWCh. 2 - Prob. 2.82HWCh. 2 - Prob. 2.83HWCh. 2 - Prob. 2.84HWCh. 2 - Prob. 2.85HWCh. 2 - Intel-compatible processors also support an...Ch. 2 - Prob. 2.87HWCh. 2 - Prob. 2.88HWCh. 2 - We are running programs on a machine where values...Ch. 2 - You have been assigned the task of writing a C...Ch. 2 - Prob. 2.91HWCh. 2 - Prob. 2.92HWCh. 2 - following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Following the bit-level floating-point coding...Ch. 2 - Prob. 2.97HW
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
The following program contains many syntax errors. Locate as many as you can. 1. / What's wrong with this progr...
Starting Out with C++: Early Objects (9th Edition)
What was the first application for Java?
Concepts Of Programming Languages
Consider the adage Never ask a question for which you do not want the answer. a. Is following that adage ethica...
Experiencing MIS
What are the advantages and disadvantages of implicit declarations?
Concepts of Programming Languages (11th Edition)
Repeat Problem 8 for a 4-input OR gate.
Digital Fundamentals (11th Edition)
Explain the meaning of the term object persistence.
Database Concepts (7th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Consider an 8-bit floating point format. In this representation 4 bits are reserved for the mantissa and 3 bits are reserved for the exponent and 1 bit is reserved for the sign of the number. The exponent of the number is stored with a bias = 3. Express the decimal number 4.75 in this 8 bit floating point format. Write down the next bigger representable number in decimal base. B If you would be conducting the following operation using this 8 bit floating point format what would the result of the following calculation be ? 4.75 + 0.05 - 4.75 Express the decimal number 4.75 in this 8 bit floating point format. [10] b) Write down the next bigger representable number in decimal base. [7.5] c) If you would be conducting the following operation using this 8 bit floating point format what would the result of the following calculation be ? 4.75 + 0.05 - 4.75arrow_forwardConsider a 32-bit hexadecimal number stored in memory as follows: Address Value 100 2A 101 C2 102 08 103 1B a) If the machine is big endian and uses two's complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex). b) If the machine is big endian and the number is an IEEE single-precision floating-point value, is the number positive or negative? c) If the machine is big endian and the number is an IEEE single-precision floating-point value, determine the decimal equivalent of the number stored at address 100 (you may leave answer in scientific notation form, as a number times a power of two). d) If the machine is little endian and uses two's complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex). e) if the machine is little endian and the number is an iEEE single-precision floating-point value, is the number positive or negative? f)…arrow_forward6. Assume we are using a simple model for floating-point representation similar to the one used in Chapter 2 of the textbook which has a 14-bit format, 5 bits for the exponent with a bias of 15 (not 16 as in the textbook), a normalized mantissa of 8 bits, and a single sign bit. Show how the computer would represent the numbers 12.125 using this representation.arrow_forward
- Assume we are using the simple model for floating-point representation discussed in the class (the representation uses a 14-bit format, 5 bits for the exponent with an Excess-M, a significand of 8 bits, and a single sign bit for the number): Convert -43.0735 to the floating-point binary representation. (Remember we learned "implied one" format in the lecture)arrow_forwardWrite programs in MSP430 language for the following questions: a(15 points) Load least significant 6 digits of your student number as ASCII characters (8-bit ASCII) into R4-R5-R6 register set. b(15 points) Add constant 10 to each character of the R4-R5-R6 register set to make a simple encryption and store results into R7-R8-R9. c(15 points) Decrypt R7-R8-R9 by subtracting by 10 and load the results into R10-R11-R12. d-(15 points) Compare the contents of the set of R4-R5-R6 and the set of R10-R11-R12. Load 1 into R13 to show both sets are the same or clear R13. For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).arrow_forwardConsider a 16-bit binary floating point number representation system: + SE E EEEE m m m m The first bit of the exponent is dedicated to its sign. Assume that the mantissa must start with a '1'. Use this system to answer the following questions: 1. What is the smallest (magnitude) number that can be represented with this system? 2. Calculate the relative round-off error introduced when this system tries to represent e = 2.718281828459045235360287 .. using rounding.arrow_forward
- If an unsigned 8-bit integer were to be extended to a 16-bit one, the first 8 most significant bits (MSB) would be filled with ones, creating a signed 16-bit representation. Pick a solution from these two options: Is it true or false that...?arrow_forwardConsider a 16-bit binary floating point number representation system: + | SE E E E E E m m т m m m m m m The first bit of the exponent is dedicated to its sign. Assume that the mantissa must start with a '1'. Use this system to answer the following question What is the smallest (magnitude) number that can be represented with this system?arrow_forwardConsider a 32-bit hexadecimal number stored in memory as follows: Address Value 100 2A 101 C2 102 08 103 1B If the machine is little endian and the number is an IEEE single-precision floating-point value, determine the decimal equivalent of the number stored at address 100 (you may leave your answer in scientific notation form, as a number times a power of two).arrow_forward
- 3. Implement a 32-bit subtraction of two numbers X and Y that are stored in memory as: X = (DS: 503H) MS byte of MS word (DS: 0502H) (DS: 0501H) (DS: 0500H) LS byte of MS byte of LS byte of MS word LS word LS word Y = (DS:0507H) (DS: 0506H) (DS: 0505H) (DS: 0504H) The result of X - Y is to be saved in the place where X is stored in memory.arrow_forwardConsider the following arithmetic operation to be conducted using two floating numbers. 8.000+ 0.125 What is the minimum number of bits required for the mantissa of the floating point representation so that this operation could be completed without any round-off error? Explain your answer with calculations.arrow_forwardGive the quantity represented by the following IEEE 754 single precision floating point value: 10000 0000 0100 0000 0000 0000 0000 00 x 2 Do this by dragging two items from the below list into the correct spaces in the above expression. -128 -126 -1.0 -1.01 -1.1 -129 -127arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Instruction Format (With reference to address); Author: ChiragBhalodia;https://www.youtube.com/watch?v=lNdy8HREvgo;License: Standard YouTube License, CC-BY