Register

GO Classes DPP | GATE CS | Discrete Mathematics| Set Theory

233 views

2 Answers

0 0 votes

we can do this question by drawing hasse diagram   for the give problem 

Nof  Different relation for the given  set. 

1. Remove self  loop created   with nodes .

2.  Remove  Transitive relation (arrow ) edges between arrow. 

As twelve is divisible by element of of every set. then it is a greatest  elment of set P . 

so option C is corrrect.

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | GAT...Next → · GO Classes DPP | GAT...
← Previous in category · GO Classes DPP | GAT...Next in category → · GO Classes DPP | GAT...
Position:
Show:

Related questions

2 2 votes
3 3 answers
224
224 views
GO Classes asked Apr 6
224 views
GO Classes DPP | GATE CS | Discrete Mathematics| Set Theory
In a school, there are three types of games to be played. Some of the students play two types of games, but none play all the three games. Which Venn diagram can justify ...
2 2 votes
2 2 answers
226
226 views
GO Classes asked Apr 6
226 views
GO Classes DPP | GATE CS | Discrete Mathematics| Set Theory
Let L be a lattice and if ,, $a, b, c \in l$, then $a \wedge(a \vee \vee b) \ldots \ldots \ldots$bacNone of these
2 2 votes
2 2 answers
200
200 views
GO Classes asked Apr 6
200 views
GO Classes DPP | GATE CS | Discrete Mathematics| Set Theory
The set of natural number under divisibility forms $\_\_\_\_$Non PosetPosetBoth A and BNone of these
2 2 votes
3 3 answers
235
235 views
GO Classes asked Apr 6
235 views
GO Classes DPP | GATE CS | Discrete Mathematics| Set Theory
Partial ordered relation on non-empty set $P$ isReflexiveAnti-SymmetricTransitiveAll above