If the partial order of a set has at most one minimal element, then t – McqOptions

MCQOPTIONS

1.	If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity __________
A.	NP-complete
B.	O(n2)
C.	O(n+2)
D.	O(n3)
Answer» B. O(n2)

Discussion

No Comment Found

Related MCQs

Let G be the graph defined as the Hasse diagram for the ⊆ relation on the set S{1, 2,…, 18}. How many edges are there in G?
Suppose P1 is a partially ordered class and a cut of P1 is pair (D, T) of nonempty subclasses of P1 satisfies which of the following properties?
In a poset P({v, x, y, z}, ⊆) which of the following is the greatest element?
In a poset (S, ⪯), if there is no element n∈S with m<n, then which of the following is true?
In which of the following relations every pair of elements is comparable?
The relation ≤ is a partial order if it is ___________
Which of the following relation is a partial order as well as an equivalence relation?
If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity __________
If a partial order is drawn as a Hasse diagram in which no two edges cross, its covering graph is called ______
Hasse diagrams are first made by ______