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(n^2)(c) O(n+2)(d) O(n^3)This question was addressed to me in an international level competition.This key question is from Graphs topic in chapter Graphs of Discrete Mathematics

If the partial order of a set has at most one minimal element, then to

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(n^2)(c) O(n+2)(d) O(n^3)This question was addressed to me in an international level competition.This key question is from Graphs topic in chapter Graphs of Discrete Mathematics
Answer» Right choice is (a) NP-complete Easy explanation: If the PARTIAL order has at most ONE minimal element, or it has at most one MAXIMAL element, then to test whether a partial order with multiple sources and SINKS can be drawn as a crossing-free Hasse DIAGRAM or not it’s time complexity is NP-complete.

Discussion

No Comment Found

Related InterviewSolutions

For any graph say G, Cayley graph is ______________(a) canonial(b) not canonical(c) isomorphic(d) homomorphicI have been asked this question in class test.My enquiry is from Graph’s Matrices in portion Graphs of Discrete Mathematics
In Modern particle physics there must exist ______________(a) group theory(b) graph theory(c) lattice structure(d) invariant semigroupThis question was addressed to me during an online interview.Enquiry is from Graph’s Matrices in chapter Graphs of Discrete Mathematics
In basic ring theory, any ring R1 may be embedded in its own ________(a) semilattice(b) endomorphism ring(c) homomorphic ring(d) subgroupI had been asked this question in class test.My query is from Graph’s Matrices topic in division Graphs of Discrete Mathematics
A Latin square graph is a representation of a _______(a) quasi group(b) homomorphic group(c) semigroup(d) subgroupThe question was posed to me in a national level competition.My question comes from Graph’s Matrices topic in chapter Graphs of Discrete Mathematics
There exists _______ between group homology and group cohomology of a finite group.(a) homomorphism(b) isomorphism(c) automorphism(d) semilattice structureThis question was addressed to me by my school principal while I was bunking the class.My question is based upon Graph’s Matrices topic in division Graphs of Discrete Mathematics
If any group is a manifold what is the dimension of that group?(a) same as manifold(b) same as vector space(c) infinite(d) finiteThis question was posed to me during a job interview.I want to ask this question from Graph’s Matrices topic in portion Graphs of Discrete Mathematics
Which of the following can be embedded in an algebraically closed group?(a) infinite group(b) stargraph(c) a countable group(d) a semilatticeI had been asked this question during an online exam.The above asked question is from Graph’s Matrices topic in section Graphs of Discrete Mathematics
Which of the following is the set of m×m invertible matrices?(a) a permutation group of degree m^2(b) a general linear group of degree m(c) a sublattice group of degree m(d) a isomorphic graph of m nodesThis question was addressed to me at a job interview.My doubt is from Graph’s Matrices in division Graphs of Discrete Mathematics
In invariant algebra, some generators of group G1 that goes either into itself or zero under ______ with any other element of the algebra.(a) commutation(b) permutation(c) combination(d) latticeThe question was posed to me in homework.The query is from Graph’s Matrices topic in chapter Graphs of Discrete Mathematics
A direct product of a group G possess which of the following characteristics?(a) a multiplication of subgroups of G(b) a factorization via subgroups of G(c) a superset of subgroups of G(d) a maximal power set of subgroupsI have been asked this question in an interview for internship.My question comes from Graph’s Matrices in portion Graphs of Discrete Mathematics

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment