Discrete Maths - Partial Ordering Lattice and Boolean Algebra

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Engineering Maths > > Discrete Maths > > Partial Ordering Lattice and Boolean Algebra

6. Principle of duality is defined as

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


7. Different partially ordered sets may be represented by the same Hasse diagram if they are

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


8. The absorption law is defined as

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


9. A partial order is deined on the set

S = {x, a1, a2, a3,...... an, y}

as x ≤  a i for all i and ai   ≤  y for all i, where n  ≥ 1.

Number of total orders on the set S which contain partial order  ≤ is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


10. Let L be a set with a relation R which is transitive, antisymmetric and reflexive and for any two elements a, b ∈ L. Let least upper bound lub (a, b) and the greatest lower bound glb (a, b) exist. Which of the following is/are TRUE ?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *