A Poset in which every pair of elements has both a least upper bound – McqOptions

MCQOPTIONS

1.	A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as _______
A.	sublattice
B.	lattice
C.	trail
D.	walk
Answer» C. trail

Discussion

No Comment Found

Related MCQs

A free semilattice has the _______ property.
Every poset that is a complete semilattice must always be a _______
The graph is the smallest non-modular lattice N5. A lattice is _______ if and only if it does not have a _______ isomorphic to N5.
A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if _________
The graph given below is an example of _________
A ________ has a greatest element and a least element which satisfy 0<=a<=1 for every a in the lattice(say, L).
______ and _______ are the two binary operations defined for lattices.
If every two elements of a poset are comparable then the poset is called ________
In the poset (Z+, |) (where Z+ is the set of all positive integers and | is the divides relation) are the integers 9 and 351 comparable?
A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as _______