Discrete Mathematics
Set Theory & Algebra
Marks 1Marks 2Marks 5
Linear Algebra
Marks 1Marks 2
Combinatorics
Marks 1Marks 2
Mathematical Logic
Marks 1Marks 2Marks 5
Probability
Marks 1Marks 2
1
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
2
GATE CSE 2016 Set 1
Numerical
+2
-0
A function $$f:\,\,{N^ + } \to {N^ + },$$ defined on the set of positive integers $${N^ + },$$ satisfies the following properties: $$$\eqalign{ & f\left( n \right) = f\left( {n/2} \right)\,\,\,\,if\,\,\,\,n\,\,\,\,is\,\,\,\,even \cr & f\left( n \right) = f\left( {n + 5} \right)\,\,\,\,if\,\,\,\,n\,\,\,\,is\,\,\,\,odd \cr} $$$

Let $$R = \left\{ i \right.|\exists j:f\left( j \right) = \left. i \right\}$$ be the set of distinct values that $$f$$ takes. The maximum possible size of $$R$$ is _____________________.

Your input ____
3
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Let $$R$$ be a relation on the set of ordered pairs of positive integers such that $$\left( {\left( {p,q} \right),\left( {r,s} \right)} \right) \in R$$ if and only if $$p - s = q - r.$$ Which one of the following is true about $$R$$?
A
Both reflexive and symmetric
B
Reflexive but not symmetric
C
Not reflexive but symmetric
D
Neither reflexive nor symmetric
4
GATE CSE 2015 Set 2
Numerical
+2
-0
The number of onto functions (subjective functions) from set $$X = \left\{ {1,2,3,4} \right\}$$ to set $$Y = \left\{ {a,b,c} \right\}$$ is __________________.
Your input ____
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization