1
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
It gives non-uniform priority to various devices.
A
It gives non-uniform priority to various devices.
B
It gives uniform priority to all devices.
C
It is only useful for connecting slow devices to a processor
D
It requires a separate interrupt pin on the processor for each device.
2
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-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.
A
(ii) and (iii) are true
B
(i) and (ii) are true
C
(iii) and (iv) are true
D
(ii) and (iv) are true
3
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sequences denotes the post order traversal sequence of the tree of previous question?
A
f e g c d b a
B
g c b d a f e
C
g c d b f e a
D
f e d g c b a
4
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
In the balanced binary tree in Fig. given below, how many nodes will become unbalanced when a node is inserted as a child of the node “g”? GATE CSE 1996 Data Structures - Trees Question 71 English
A
1
B
3
C
7
D
8
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12