edited by
20,579 views
45 votes
45 votes

Consider the following floating-point number representation.$$\begin{array}{c|c}
\begin{array}{cc}31\;\;\hspace{15pt}&\hspace{15pt}24\end{array} & \begin{array}{cc}23\hspace{15pt}&\hspace{15pt}0\end{array} \\\hline
\text{Exponent}&\text{Mantissa}\\ \hline
\end{array}$$The exponent is in $2’s$ complement representation and the mantissa is in the sign-magnitude representation. The range of the magnitude of the normalized numbers in this representation is

  1. $0$ to $1$
  2. $0.5$ to $1$
  3. $2^{-23}$ to $0.5$
  4. $0.5$ to $\left(1-2^{-23}\right)$
edited by

2 Answers

Best answer
55 votes
55 votes

Here, we are asked "magnitude" - so we just need to consider the mantissa bits. 

Also, we are told "normalized representation"- so most significant bit of mantissa is always 1 (this is different from IEEE 754 normalized representation where this 1 is omitted in representation, but here it seems to be added on the right of decimal point as seen from options). 

So, the maximum value of mantissa will be 23 1's where a decimal point is assumed before first 1. So, this value will be $1-2^{-23}$.

Due to the 1 in normalized representation, the smallest positive number will be 1 followed by 23 0's which will be $2^{-1} = 0.5.$ 

So ans d.

selected by
24 votes
24 votes
Given that mantissa is sign magnitude representation so 1 bit for sign and remaining 23 bits for mantissa

and  we have to find the range of mantissa in normalized form ....

so smallest will be = .100.....0(normalize form) which is 2^(-1) = .5

and for largest will be .111....1 which is 1-2^(-23) .

so range will be .5 to (1-2^(-23))
edited by
Answer:

Related questions

24 votes
24 votes
2 answers
1
Kathleen asked Oct 9, 2014
7,492 views
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is$101010\ldots1010$$100000\ldots 0001$$111111\ldots 1111$$011111\ldots...
33 votes
33 votes
2 answers
2
Kathleen asked Oct 9, 2014
18,549 views
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is$256 \times 16$$64 K \times 8$$4 K \times 16$$64 K \times...
6 votes
6 votes
1 answer
3
go_editor asked Feb 10, 2018
2,338 views
Consider the synchronous sequential circuit in the below figureGiven that the initial state of the circuit is $S_4,$ identify the set of states, which are not reachable.
18 votes
18 votes
2 answers
4
Kathleen asked Oct 9, 2014
6,374 views
Consider the synchronous sequential circuit in the below figureDraw a state diagram, which is implemented by the circuit. Use the following names for the states correspon...