Follow Us :

Discrete Maths - Partial Ordering Lattice and Boolean Algebra

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

1. Let D30 = {1, 2, 3, 4, 5, 6, 10, 15, 30} and relation I be partial ordering on D30. The all lower bounds of 10 and 15 respectively 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 *


2. Hasse diagrams are drawn for

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 *


3. A self-complemented, distributive lattice is called

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 *


4. Let  D30 = {1, 2, 3, 5, 6, 10, 15, 30} and relation I be a partial ordering on D30. The lub 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 *


5. Let X = {2, 3, 6, 12, 24}, and ≤ be the partial order defined by X ≤ Y if X divides Y. Number of edges in the Hasse diagram of (X, ≤ ) 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 *


Related Quiz.
Partial Ordering Lattice and Boolean Algebra