edited by
18,069 views
65 votes
65 votes

The following is a scheme for floating point number representation using $16$ bits.

Let $s, e,$ and $m$ be the numbers represented in binary in the sign, exponent, and mantissa fields respectively. Then the floating point number represented is:

$$\begin{cases}(-1)^s \left(1+m \times 2^{-9}\right) 2^{e-31}, & \text{ if the exponent } \neq 111111 \\  0, & \text{ otherwise} \end{cases}$$

What is the maximum difference between two successive real numbers representable in this system?

  1. $2^{-40}$
  2. $2^{-9}$
  3. $2^{22}$
  4. $2^{31}$
edited by

9 Answers

0 votes
0 votes
for same exponent any two successive real numbers can differ maximum by magnitude of the least significant matissa. Here the least representable matissa would be 2^-9. the max difference will hence occur for the highest exponent cases. Here 31 (62-31 as explained in other answers)... so the magnitude of max difference will be 2^-9 *2^31 = 2^22
Answer:

Related questions

28 votes
28 votes
5 answers
1
Kathleen asked Sep 16, 2014
10,436 views
Assuming all numbers are in $2’s$ complement representation, which of the following numbers is divisible by $11111011$?$11100111$$11100100$$11010111$$11011011$
29 votes
29 votes
1 answer
4