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 1998
Subjective
+2
-0
Let (A, *) be a semigroup. Furthermore, for every a and b in A, if $$a\, \ne \,b$$, then $$a\,*\,b \ne \,\,b\,*\,a$$.

(a) Show that for every a in A
a * a = a
(b) Show that for every a, b in A
a * b * a = a
(c) Show that for every a, b, c in A
a * b * c = a * c

2
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
The binary relation R = {(1, 1)}, (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (3, 4) } on the set A = { 1, 2, 3, 4} is
A
Reflexive, symmetric and transitive
B
Neither reflexive, nor irreflexive but transitive
C
Irreflexive, symmetric and transitive
D
Irreflexive and antisymmetric
3
GATE CSE 1998
Subjective
+2
-0
Suppose A = {a, b, c, d} and $${\Pi _1}$$ is the following partition of A

$${\Pi _1}\, = \,\{ \{ a,\,\,b,\,\,c\,\} \,,\,\{ d\} \,\} $$
(a) List the ordered pairs of the equivalence relations induced by $${\Pi _1}$$
(b) Draw the graph of the above equivalence relation.

4
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
Let R denote the set of real numbers. Let f: $$R\,x\,R \to \,R\,x\,R\,$$ be a bijective function defined by f (x, y ) = (x + y, x - y). The inverse function of f is given by
A
$${f^{ - 1}}\,(x,\,y)\, = \,\left( {{1 \over {x\, + \,y}},\,{1 \over {x\, - \,y}}} \right)$$
B
$${f^{ - 1}}\,(x,\,y)\, = \,\,(x\, - \,y,\,\,x\, + y)$$
C
$${f^{ - 1}}\,(x,\,y)\, = \,\left( {{{x\, + \,y} \over 2},\,{{x\, - \,y} \over 2}} \right)$$
D
$${f^{ - 1}}\,(x,\,y)\, = \,(2\,(x\, - \,y),\,2\,(x\, + y))$$
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