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.
Trending nowThis is a popular solution!
Learn your wayIncludes step-by-step video
Chapter 2 Solutions
Computer Systems: A Programmer's Perspective Plus Mastering Engineering With Pearson Etext -- Access Card Package (3rd Edition)
Additional Engineering Textbook Solutions
Starting Out with C++: Early Objects (9th Edition)
Concepts Of Programming Languages
Experiencing MIS
Concepts of Programming Languages (11th Edition)
Digital Fundamentals (11th Edition)
Database Concepts (7th Edition)
- I could use some help converting this problem into code for IA32 x86 Assembly floatIsEqual - Compute f == g for floating point arguments f and g. Both the arguments are passed as unsigned int's, but they are to be interpreted as the bit-level representations of single-precision floating point values. If either argument is NaN, return 0 +0 and -0 are considered equal.arrow_forwardIn a Digital Logic examination, you are given two signed integers in different number systems. A= (64)16 B= -(103)8Determine their values in the decimal system AN, b) Find the value of n, the shortest word-length of a computer using two’s complement representation which can represent all these numbers. Find the largest and thesmallest numbers that can be represented. c) Give the n-bit two’s complement representations of the two numbers, where n isvalue determined in b.arrow_forwardSuppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word: 1 0 1 0 1 0 1 1 1 1 0 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error?arrow_forward
- Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word: 1 0 1 0 1 0 1 0 1 1 0 Assuming odd parity, is this a legal code word? If not, according to our error-correcting code, where is the error?arrow_forwardConsider a 6-bit two’s complement representation. Fill in the box with question mark "?" in the following table. You don't need to care about "n/a." Number Binary Representation TMin + TMin ? Please input the binary representation in this format xxxxxx. For example, if the answer is 010010, please input 010010.arrow_forwardSuppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. a) How long should the check bits and why? b) Code words are created according to the Hamming Algorithm presented in the text. We now receive the following code word: 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error? PLEASE SHOW ALL WORKING UNDERSTANDABLE THANK YOUarrow_forward
- Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 12. a) How long should the check bits and why? b) Code words are created according to the Hamming Algorithm presented in the text. We now receive the following code word: 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 Assuming even parity, is this a legal code word? If not, according to our error-correcting code, where is the error?arrow_forwardIf 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_forwardShow Steps Please 5. Compute the Hamming distance of the following code: 0011010010111100 0000011110001111 0010010110101101 0001011010011110 6. Suppose we are given the following subset of codewords, created for a 7-bit memory word with one parity bit: 11100110, 00001000, 10101011, and 11111110. Does this code use even or odd parity? Explain. 7. Given that the ASCII code for A is 1000001, what is the ASCII code for J? b. Given that the EBCDIC code for A is 1100 0001, what is the EBCDIC code for J? 8. Decode the following ASCII message, assuming 7-bit ASCII characters and no parity: 1001010 1001111 1001000 1001110 0100000 1000100 1001111 1000101arrow_forward
- Bit Manipulation We reviewed bitwise logical operations in C (&=AND, |=OR, ^=XOR): A = 0011 1100 B = 0000 1101 --------------------- A&B = 0000 1100 A|B = 0011 1101 A^B = 0011 0001 For the following three questions, assume: A = 1010 1010 1010 B = 0000 1111 0000 And compute the results of these bitwise operations: (A & B)& B 1 Answer: (A | B)| B 2 Answer: (A ^ B)^ B 3 Answer: We also discussed the C shift operations (shift left=<< and shift right=>>). For the following two questions, assume: C = 0001 1001 1010 And compute the results of these shift operations: 4. C >> 3 4 Answer: 5. C << 2 5 Answer:arrow_forwardConsider 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_forwardSuppose we are given the following subset of code words,created for a 7-bit memory word with one parity bit: 11100110,00001000, 10101011, and 11111110. Does this code use even or oddparity? Explain.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