1
GATE CSE 2016 Set 2
Numerical
+1
-0
The minimum number of colours that is sufficient to vertex-colour any planar graph is _____________ .
Your input ____
2
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+2
-0.6
A binary relation $$R$$ on $$N \times N$$ is defined as follows: $$(a,b)R(c,d)$$ if $$a \le c$$ or $$b \le d.$$ Consider the following propositions:

$$P:$$ $$R$$ is reflexive
$$Q:$$ $$R$$ is transitive

Which one of the following statements is TRUE?

A
Both $$P$$ and $$Q$$ are true
B
$$P$$ is true and $$Q$$ is false
C
$$P$$ is false and $$Q$$ is true
D
Both $$P$$ and $$Q$$ are false
3
GATE CSE 2016 Set 2
Numerical
+2
-0
The value of the expression $${13^{99}}$$ ($$mod$$ $$17$$), in the range $$0$$ to $$16,$$ is ______________ .
Your input ____
4
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)