1

### GATE CSE 2015 Set 2

Consider the following two statements.

$S1:$ If a candidate is known to be corrupt, then he will not be elected
$S2:$ If a candidate is kind, he will be elected

Which one of the following statements follows from $S1$ and $S2$ as per sound inference rules of logic?

A
If a person is known to be corrupt, he is kind
B
If a person is not known to be corrupt, he is not kind
C
If a person is kind, he is not known to be corrupt
D
If a person is not kind, he is not known to be corrupt
2
Numerical

### GATE CSE 2015 Set 2

The cardinally of the power set of $\left\{ {0,1,2,\,\,....,\,\,10} \right.\left. \, \right\}$ is _____________.

3
Numerical

### GATE CSE 2015 Set 2

The number of divisors of $2100$ is ___________.

4

### GATE CSE 2015 Set 2

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is
A
A multiple of $4$
B
Even
C
Odd
D
Congruent to $0$ $mod$ $4$, or, $1$ $mod$ $4.$

### Paper Analysis of GATE CSE 2015 Set 2

Subject NameTotal Questions
Algorithms5
Compiler Design3
Computer Networks6
Computer Organization4
Data Structures3
Database Management System4
Digital Logic3
Discrete Mathematics12
Operating Systems4
Programming Languages3
Software Engineering3
Theory of Computation4
Web Technologies1