1
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Which of the following functionalities must be implemented by a transport protocol over and above the network protocol?
A
Recovery from packet losses
B
Detection of duplicate packets
C
Packet delivery in the correct order
D
End to end connectivity
2
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}}$$
3
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
For a pipelined $$CPU$$ with a single $$ALU$$, consider the following situations
$$1.\,\,\,\,\,$$ The $$j+1$$ instruction uses the result of the $$j$$-$$th$$ instruction as an operand
$$2.\,\,\,\,\,$$ The execution of a conditional jump instruction
$$3.\,\,\,\,\,$$ The $$j$$-$$th$$ and $$j+1$$ instruction require the $$ALU$$ at the same time

Which of the above can cause a hazard?

A
$$1$$ and $$2$$ only
B
$$2$$ and $$3$$ only
C
$$3$$ only
D
ALL the three
4
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
Let S be a stack of size n >= 1. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform n pop operations. Assume that Push and Pop operations take X seconds each, and Y seconds elapse between the end of one such stack operation and the start of the next operation. For m >= 1, define the stack-life of m as the time elapsed from the end of Push(m) to the start of the pop operation that removes m from S. The average stack-life of an element of this stack is
A
n(X + Y)
B
3Y + 2X
C
n(X + Y) - X
D
Y + 2X
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12