1
Numerical

### GATE CSE 2016 Set 2

Consider the following expressions:
$\,\,\,\,\,\,\,\,\,\,\,\,\,$ $(i)$ $\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$ false
$\,\,\,\,\,\,\,\,\,\,\,\,$ $(ii)$ $\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$ $Q$
$\,\,\,\,\,\,\,\,\,\,\,$ $(iii)$ $\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$ true
$\,\,\,\,\,\,\,\,\,\,\,\,$ $(iv)$ $\,\,\,\,\,\,\,\,\,\,\,$ $P∨Q$
$\,\,\,\,\,\,\,\,\,\,\,\,\,$ $(v)$ $\,\,\,\,\,\,\,\,\,\,\,\,$ $\neg QVP$

The number of expressions given above that are logically implied by $P \wedge \left( {P \Rightarrow Q} \right)$) is _____________.

2
Numerical

### GATE CSE 2016 Set 2

Let $f(x)$ be a polynomial and $g\left( x \right) = f'\left( x \right)$ be its derivative. If the degree of $\left( {f\left( x \right) + f\left( { - x} \right)} \right)$ is $10,$ then the degree of $\left( {g\left( x \right) - g\left( { - x} \right)} \right)$ is ___________.

3
Numerical

### GATE CSE 2016 Set 2

The minimum number of colours that is sufficient to vertex-colour any planar graph is _____________ .

4

### GATE CSE 2016 Set 2

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

### Paper Analysis of GATE CSE 2016 Set 2

Subject NameTotal Questions
Algorithms5
Compiler Design3
Computer Networks6
Computer Organization6
Data Structures5
Database Management System4
Digital Logic3
Discrete Mathematics11
Operating Systems3
Theory of Computation6
General Aptitude10