1
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
The following is a scheme for floating point number representation using $$16$$ bits. GATE CSE 2003 Computer Organization - Computer Arithmetic Question 8 English

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
MCQ (Single Correct Answer)
+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
MCQ (Single Correct Answer)
+2
-0.6
The number of full and half-adders required to add 16-bit numbers is:
A
8 half-adders, 8 full-adders
B
1 half-adder, 15 full-adders
C
16 half-adders, 0 full-adders
D
4 half-adders, 12 full-adders
4
GATE CSE 1999
MCQ (Single Correct Answer)
+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
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12