1
GATE CSE 2003
+2
-0.6
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

$$\left\{ {\matrix{ {{{\left( { - 1} \right)}^s}\left( {1 + m \times {2^{ - 9}}} \right){2^{e - 31}},} & {if\,the\,{\mathop{\rm exponent}\nolimits} \, \ne \,111111} \cr {\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,0} & {otherwise\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,} \cr } } \right.$$

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

A
$${2^{ - 40}}$$
B
$${2^{ - 9}}$$
C
$${2^{ 22}}$$
D
$${2^{ 31}}$$
2
GATE CSE 2002
+2
-0.6
Sign extension is the step in
A
Floating point multiplication
B
Signed $$16$$ bit integer addition
C
Arithmetic left shift
D
Converting a signed integer from one size to another
3
GATE CSE 1999
+2
-0.6
The number of full and half-adders required to add 16-bit numbers is:
A
B
C
D
4
GATE CSE 1999
+2
-0.6
Booth’s coding in $$8$$ bits for the decimal number –$$57$$ is:
A
$$0\, - \,1\,0\,0\, + \,1\,0\,0\,0$$
B
$$0\, - \,1\,0\,0\, + \,1\,0\,0\, - \,1$$
C
$$0\, - \,1\, + \,1\,0\,0\, - \,1\,0\, + \,1$$
D
$$0\,0\, - \,1\,0\, + \,1\,0\,0\, - \,1$$
GATE CSE Subjects
EXAM MAP
Medical
NEET