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

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

8. The absorption law is defined as

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

9. A partial order is deined on the set

S = {x, a₁, a₂, a₃,...... a_n, y}

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

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

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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 ?

Answer
Comment
Array

Option : C
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.