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

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

2. Hasse diagrams are drawn for

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

3. A self-complemented, distributive lattice is called

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

4. Let D₃₀ = {1, 2, 3, 5, 6, 10, 15, 30} and relation I be a partial ordering on D₃₀. The lub of 10 and 15 respectively is

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Partial Ordering Lattice and Boolean Algebra

Forgot your password?

I agree with the Terms.