1
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following well-formed formulae in predicate calculus is NOT valid?
A
$$\left( {\forall xp\left( x \right) \vee \forall xq\left( x \right)} \right) \Rightarrow \left( {\exists x\neg p\left( x \right) \vee \forall xq\left( x \right)} \right)$$
B
$$\left( {\exists xp\left( x \right) \vee \exists xq\left( x \right)} \right) \Rightarrow \exists x\left( {p\left( x \right) \vee q\left( x \right)} \right)$$
C
$$\exists x\left( {p\left( x \right) \wedge q\left( x \right)} \right) \Rightarrow \left( {\exists xp\left( x \right) \wedge \exists xq\left( x \right)} \right)$$
D
$$\forall x\left( {p\left( x \right) \vee q\left( x \right)} \right) \Rightarrow \left( {\forall xp\left( x \right) \vee \forall xq\left( x \right)} \right)$$
2
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?
A
$$LRU$$ (Least Recently Used)
B
$$OPT$$ (Optimal Page Replacement)
C
$$MRU$$ (Most Recently Used)
D
$$FIFO$$ (First In First Out)
3
GATE CSE 2016 Set 2
Numerical
+2
-0
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first.

Process Arrival Time Burst Time
P1
P2
P3
P4
0
3
7
8
10
6
1
3

The average turn around time of these processes is milliseconds.

Your input ____
4
GATE CSE 2016 Set 2
Numerical
+2
-0
Consider a non-negative counting semaphore $$S.$$ The operation $$P(S)$$ decrements $$S,$$ and $$V(S)$$ increments $$S.$$ During an execution, $$20$$ $$P(S)$$ operations and $$12$$ $$V(S)$$ operations are issued in some order. The largest initial value of $$S$$ for which at least one $$P(S)$$ operation will remain blocked is _____________ .
Your input ____