1
GATE CSE 1994
MCQ (Single Correct Answer)
+1
-0.3
Let A and B be any two arbitrary events, then, which one of the following is true?
A
$$P\,(A\, \cap \,B)\, = \,P\,(A)\,P\,(B)$$
B
$$P\,(A\, \cup \,B)\, = \,P\,(A)\, + \,P\,(B)$$
C
$$P\,(A\,\left| {B) = \,} \right.P\,(A\, \cap \,B)\,P\,(B)$$
D
$$P\,(A\, \cup \,B)\, < \,\,P\,(A)\, + \,P\,(B)$$
2
GATE CSE 1994
Subjective
+5
-0
Consider the resource allocation graph given in the figure. GATE CSE 1994 Operating Systems - Deadlocks Question 12 English
(a) Find if the system is in a deadlock state.
(b) Otherwise, find a safe sequence.
3
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
Consider the following heap (Figure) in which blank regions are not in use and hatched region are in use.

The sequence of requests for blocks of size $$300, 25, 125, 50$$ can be satisfied if we use.

GATE CSE 1994 Operating Systems - Memory Management Question 27 English
A
Either first fit or best fit policy (any one)
B
First fit but not best fit policy
C
Best fit but first fit policy
D
None of the above
4
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when
A
LRU page replacement algorithm is used
B
FIFO page replacement algorithm is used
C
LFU page replacement algorithm is used
D
None of the above
EXAM MAP