Discrete Maths - Partial Ordering Lattice and Boolean Algebra

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

11. If lattice (C ,≤) is a complemented chain, then

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 *


12. The less than relation, <, on reals 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 *


13. Which of the following lattices are Boolean?

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 *


14. Which of the following is not a "lattice"?

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 *


15. Let D30 = (l, 2, 3, 5, 6, 10, 15,30) and relation I be
a partial ordering on D30. The all upper bounds of
10 and 15 respectively 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 *