GATE CSE 1996 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

Both’s algorithm for integer multiplication gives worst performance when the multiplier pattern is

$$101010 ....1010$$

$$100000 .....0001$$

$$111111 ......1111$$

$$011111 .....1110$$

GATE CSE 1996

MCQ (Single Correct Answer)

-0.6

Consider the following floating point number representation GATE CSE 1996 Computer Organization - Computer Arithmetic Question 12 English

The exponent is in $$2’s$$ complement representation and mantissa is in the sign magnitude representation. The range of the magnitude of the normalized mantissa in this representation is

$$0$$ to $$1$$

$$0.5$$ to $$1$$

$${2^{ - 23}}$$ to $$0.5$$

$$0.5$$ to $$\left( {1 - {2^{ - 23}}} \right)$$

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

Consider the following statements:
(i) First-in-first out types of computations are efficiently supported by STACKS.
(ii) Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.
(iii) Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.
(iv) Last-in-first-out type of computations are efficiently supported by QUEUES.

(ii) and (iii) are true

(i) and (ii) are true

(iii) and (iv) are true

(ii) and (iv) are true

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

Which of the following sequences denotes the post order traversal sequence of the tree of previous question?

f e g c d b a

g c b d a f e

g c d b f e a

f e d g c b a

PREVIOUS NEXT

GATE CSE Papers

2024