GATE CSE 2016 Set 2 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2016 Set 2

MCQ (Single Correct Answer)

-0.6

Which one of the following well-formed formulae in predicate calculus is NOT valid?

$$\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)$$

$$\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)$$

$$\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)$$

$$\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)$$

GATE CSE 2016 Set 2

Numerical

-0

The value of the expression $${13^{99}}$$ ($$mod$$ $$17$$), in the range $$0$$ to $$16,$$ is ______________ .

Your input ____

GATE CSE 2016 Set 2

MCQ (Single Correct Answer)

-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?

$$LRU$$ (Least Recently Used)

$$OPT$$ (Optimal Page Replacement)

$$MRU$$ (Most Recently Used)

$$FIFO$$ (First In First Out)

GATE CSE 2016 Set 2

Numerical

-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
P₁ P₂ P₃ P₄	0 3 7 8	10 6 1 3

The average turn around time of these processes is milliseconds.

Your input ____

PREVIOUS NEXT

GATE CSE Papers

2023