Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

GATE | GATE CS 1999 | Question 51

[5 Marks question]

  1. 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 yRy. Now because R is transitive, xRy and yRy together imply xRx. Therefore, R is reflexive.”
    Briefly point out the flaw in Mr. X’s proof.
  2. Give an example of relation R which is symmetric and transitive but not reflexive.

Answer:
Explanation:
Quiz of this Question

Article Tags :
GATE
Recommended Articles
1. GATE | GATE CS 1999 | Question 36
2. GATE | GATE CS 1999 | Question 26
3. GATE | GATE CS 1999 | Question 27
4. GATE | GATE CS 1999 | Question 28
5. GATE | GATE CS 1999 | Question 29
6. GATE | GATE CS 1999 | Question 30
7. GATE | GATE CS 1999 | Question 31
8. GATE | GATE CS 1999 | Question 32
9. GATE | GATE CS 1999 | Question 57
10. GATE | GATE CS 1999 | Question 56
11. GATE | GATE CS 1999 | Question 48
12. GATE | GATE CS 1999 | Question 49
13. GATE | GATE CS 1999 | Question 1
14. GATE | GATE CS 1999 | Question 2
15. GATE | GATE CS 1999 | Question 3
16. GATE | GATE CS 1999 | Question 4
17. GATE | GATE CS 1999 | Question 5
18. GATE | GATE CS 1999 | Question 6
19. GATE | GATE CS 1999 | Question 7
20. GATE | GATE CS 1999 | Question 8
21. GATE | GATE CS 1999 | Question 9
22. GATE | GATE CS 1999 | Question 10
23. GATE | GATE CS 1999 | Question 11
24. GATE | GATE CS 1999 | Question 12
25. GATE | GATE CS 1999 | Question 13