GATE CS 2017 Set 2 — Question 21

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+1 / -0MediumPartial Orders & LatticesSets & CombinatoricsEngineering Mathematics

Engineering Mathematics → Sets & Combinatorics → Partial Orders & Lattices

Last updated

Question

Consider the set X={a,b,c,d,e}X = \{a, b, c, d, e\} under the partial ordering
R={(a,a),(a,b),(a,c),(a,d),(a,e),(b,b),(b,c),(b,e),(c,c),(c,e),(d,d),(d,e),(e,e)}R = \{(a, a), (a, b), (a, c), (a, d), (a, e), (b, b), (b, c), (b, e), (c, c), (c, e), (d, d), (d, e), (e, e)\}.
The Hasse diagram of the partial order (X,R)(X, R) is shown below.
Hasse diagram of the partial order (X, R)
The minimum number of ordered pairs that need to be added to RR to make (X,R)(X, R) a lattice is ______.
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Sets & Combinatorics