1
GATE CSE 1999
Subjective
+2
-0

(a) Mr. X claims the following:
If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof.

"From xRy, using symmetry we get yRx. Now because R is transitive, xRy and yRx togethrer imply xRx. Therefore, R is reflextive."


Briefly point out the flaw in Mr. X' proof.

(b) Give an example of a relation R which is symmetric and transitive but not reflexive.

2
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

3
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
4
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.

GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP