Computer Science and Information Technology
GATE CSE concept:partial-orders PYQs
Build your understanding with focused practice from past exam papers.
How to practice concept:partial-orders
Attempt a question, record the concept and assumptions, then check the available answer. Rework mistakes after revising the relevant concepts. Topic tags can overlap; review the question context.
Questions 1–3 of 3. Imported answers require independent review unless marked reviewed.
Question 42
Open questionCSMSQ2 marksNeeds review
Let
be the set of all functions from
to
. Define the binary relation
on
as follows:
if and only if
, where
.Which of the following statement(s) is/are TRUE?
Your answerSelect all correct options. You can choose more than one.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 34
Open questionCSNAT1 markNeeds review
Let
be the partial order defined on the set
as follows
The number of total orders on
that contain
is ________Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 21
Open questionCSNAT1 markNeeds review
Consider the set
under the partial ordering
.
The Hasse diagram of the partial order
is shown below. 
The minimum number of ordered pairs that need to be added to
to make
a lattice is __________.Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer