2.51. Show how each of the following floating-point values would be stored using IEEE-754 single precision (be sure to indicate the sign bit, the exponent, and the significand - i.e., fraction - fields). a. 12.5 b. -0.75 c. 26.625 Si gn-0, exponent=1000

2.51. Show how each of the following floating-point values would be stored using IEEE-754 single precision (be sure to indicate the sign bit, the exponent, and the significand - i.e., fraction - fields). a. 12.5 b. -0.75 c. 26.625 Si gn-0, exponent=1000

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

4, in the fixed-point machine, the following statement is wrong ( ).A. In addition to the complement, the original code and the inverted code cannot indicate that the original code of −1 B. +0 is not equal to −0C. the inverse of +0 is not equal to the negative of −0 D. For the same machine word length, the complement code can represent a negative number more than the original code and the inverted code.
7. Add the following two 8-bit binary numbers, producing an 8-bit result. Indicate the status of the carry and overflow bits at the end of the addition by circling the appropriate choices. The space in between is only for readability. 1101 0110 + 1001 0111 -------------- Overflow? Yes or No Carry? Yes or No
1.8 Show each of the following calculations in 4-bit two's complement notation. In each case, convert the result (in binary) back to a decimal number. (a) -5 + 7 (b) - 3 + 3 (c) 6 - 4 (d) -2 - 3
Chapter 2: Practice Problems 1. Assume we are running code on a 8-bit machine using two's complement arithmetic for signed integers. A "short" integer is encoded using 4 bits. Fill in the empty boxes in the table below. The following definitions are used in the table: short sy = -3; int y = sy; int x = -17; unsigned ux = x Note: You need not fill in entries marked with "-" Only accepted format for binary representation (use 8-bits): 00000000, 11111111 Only accepted format for hexadecimal representation: 4D, EF, FF Expression Binary Zero ux y X >> 2 Tmax Tmax+Tmin Tmin - 1 Decimal 0 -3 00110010 Hexadecimal
a. Assume (F43)(16) and (1B7)(16) are unsigned 12-bit Hexadecimal integers.CalculateF43 -1B7. Is there overflow?b. Assume 185 and 122 are unsigned 8-bit decimal integers. Calculate185 - 122. Is there overflow?c. Calculate (1100 1101)2 + (1100 10101)2
1) For IEEE 754 single precision floating point numbers, if X is a negative denormalized floating point number with mantisa 010 0000 0000 0000 0000 0000, what is the decimal value of X? Question options: a. –1.25 × 2^(–126 ) b. –1.25 × 2^(–127 ) c. –0.25 × 2^(–127) d. –0.25 × 2^(–126 ) e. None of the above 2) Which of following recursive C++ functions correctly computes a[0]+a[1]+...+a[n-1] (where n is the size of array a) ? Question options: int sum(int n, int a[] ){ return n>0? sum(n-1) + a[n] : a[0]; } int sum(int n, int a[] ){ return n>0? sum(n-1, a) + a[n-1] : a[0]; } int sum(int n, int a[] ){ return sum(n-1, a) + a[n-1] ; } int sum(int n, int a[] ){ return n>0? sum(n-1, a) + a[n] : a[0]; } int sum(int n, int a[] ){ return n>0? sum(n-1) + a[n-1] : a[0]; }
[8.4] Using the IEEE 754 floating-point format, write down the bit pattern that would represent -1/4. Can you represent-1/4 exactly?