_

KRITIKA
CSE 3rs SEM (2nd YEAR)
2314750010067
Discrete Mathematics (CSE 204)

Multiple-Choice Questions (MCQs) on properties of lattices in discrete mathematics .

1. What is a lattice in discrete mathematics?

a) A partially ordered set with a unique maximum element

b) A partially ordered set with a unique minimum element

c) A partially ordered set where every pair of elements has both a least upper bound
and a greatest lower bound

d) A totally ordered set with no upper or lower bounds

Answer: c) A partially ordered set where every pair of elements has both a least upper
bound and a greatest lower bound

Explanation:A lattice is a partially ordered set in which every pair of elements has both
a least upper bound (join) and a greatest lower bound (meet).

2. In a lattice, the join operation is denoted by:

a) ∩

b) ⊆

c) ∨

d) ∧

Answer: c) ∨

Explanation: In lattice theory, ∨ (pronounced "vee") represents the join operation.

3. Which of the following is a necessary property for a lattice?

a) Transitivity

b) Reflexivity

c) Antisymmetry
 d) Distributivity

Answer: d) Distributivity

Explanation: Distributivity is a key property in lattices. It ensures that the lattice

4. If a lattice has a unique maximum element, it is called:

a) Complemented

b) Bounded

c) Modular

d) Distributive

Answer: b) Bounded

Explanation: A lattice is called bounded if it has both a unique maximum and a unique
minimum element.

5. In a lattice, the relation "≤" is:

a) Asymmetric

b) Irreflexive

c) Transitive

d) Symmetric

Answer: c) Transitive

Explanation: The relation "≤" in a lattice is a partial order, and partial orders are
transitive.

6. What is the complement of an element in a lattice?

a) The element itself

b) The least element

c) The greatest element

d) An element such that its join with the original element is the maximum element

Answer: d) An element such that its join with the original element is the maximum
element

Explanation: In a lattice, the complement of an element is an element such that its join
with the original element is the maximum element.

7. Which of the following lattices is distributive but not complemented?

b) Modular lattice

c) Distributive lattice

d) Complemented lattice

Answer: c) Distributive lattice

Explanation: A distributive lattice is one in which the distributive law holds, but it may
not necessarily have complements.

8. What is the dual of a lattice?

a) Flipped lattice

b) Reversed lattice

c) Opposite lattice

d) Dual lattice

Answer: c) Opposite lattice

Explanation: The opposite (or dual) of a lattice is obtained by reversing the order
relation.

9. If every pair of elements in a lattice has a unique least upper bound, it is called:

a) Complete lattice

b) Complemented lattice

c) Finite lattice

d) Modular lattice

Answer: a) Complete lattice

Explanation: A complete lattice is one in which every non-empty subset has both a least
upper bound and a greatest lower bound.

10. Which property ensures that a lattice is uniquely determined by its order relation?

a) Boundedness

b) Antisymmetry

c) Irreflexivity

d) Reflextivity

Answer: b) Antisymmetry
Explanation: Antisymmetry ensures that there is at most one element x such that x ≤ y
and y ≤ x for all elements x and y in the lattice.

11. If a lattice is both distributive and complemented, it is called:

a) Boolean lattice

b) Modular lattice

c) Complemented lattice

d) Distributive lattice

Answer: a) Boolean lattice

Explanation: A Boolean lattice is a distributive lattice with complements.

12. Which lattice property is expressed by the equation x ∨ (x ∧ y) = x?

a) Idempotence

b) Absorption

c) Complement

d) Distributivity

Answer: b) Absorption

Explanation: This property is known as absorption, where combining an element with its
GLB results in the element itself.

13. In a lattice, if x ≤ y, then:

a) x = y

b) x ≥ y

c) x and y are incomparable

d) x ≤ y or x = y

Answer: d) x ≤ y or x = y

Explanation: In a lattice, if x ≤ y, then either x is equal to y or x is less than or equal to y.

14. A lattice is distributive if:

a) x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z)

b) x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z)

c) x ∧ (y ∨ z) = (x ∨ y) ∧ (x ∨ z)
 d) x ∨ (y ∧ z) = (x ∧ y) ∨ (x ∧ z)

Answer: a) x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z)

Explanation: Distributive property ensures the distribution of meet ( ∧ ) over join ( ∨ ) or

15. The lattice property x ∨ x' = 1 is related to:

a) Complement

b) Idempotence

c) Absorption

d) Distributivity

Answer: a) Complement

Explanation: This property expresses the complementation in a lattice.

16. In a lattice, if x ≤ y and y ≤ x, then:

a) x < y

b) x = y

c) x > y

d) x ∨ y = x ∧ y

Answer: b) x = y

Explanation: If x ≤ y and y ≤ x, then x and y are equal in a lattice.

17. Which operation in a lattice is both idempotent and commutative?

a) Join (∨)

b) Meet (∧)

c) Complement

d) Dual

Answer: a) Join (∨)

Explanation: The join operation (∨) in a lattice is both idempotent and commutative

18. The lattice property "a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c)" is known as:

a) Distributive law
 b) Commutative law

c) Associative law

d) Idempotent law

Answer: a) Distributive law

19. The lattice property "a ∨ (a ∧ b) = a" is known as:

a) Idempotent law

b) Absorption law

c) Complement law

d) Associative law

Answer: b) Absorption law

20. What is the dual of a lattice property?

a) The same property

b) The negation of the property

c) The reverse of the property

d) The complement of the property

Answer: b) The negation of the property

21. Which of the following is a lattice, but not a distributive lattice?

a) Boolean lattice

b) Modular lattice

c) Complemented lattice

d) Distributive lattice

Answer: b) Modular lattice

22. The lattice property "a ∨ b = b ∨ a" is known as:

a) Commutative law

b) Associative law

c) Distributive law

d) Idempotent law
Answer: a) Commutative law

23.Which property characterizes a lattice where for any elements a, b, and c, (a ∧ b) ∨

a) Distributivity

b) Commutativity

c) Absorption

d) Idempotence

Answer: c) Absorption

Explanation: Absorption property in a lattice states that (a ∧ b) ∨ (a ∧ c) = a.

24.If in a lattice, for any elements a and b, a ∧ (a ∨ b) = b, it is called a:

a) Complemented lattice

b) Distributive lattice

c) Modular lattice

d) Boolean lattice

Answer: c) Modular lattice

Explanation: A modular lattice satisfies the modular law relating join and meet
operations.

25.In a lattice, what term is used for an element x such that for every element y, x ∨ y =
y?

a) Complement

b) Greatest element

c) Join-irreducible

d) Least element

Answer: d) Least element

Explanation: The least element is an element that, when joined with any other element,
gives the other element itself.

26.Which property characterizes a lattice where for any elements a, b, and c, (a ∨ b) ∧ c

b) Distributivity

c) Idempotence

d) Complementarity

Answer: b) Distributivity

Explanation: Distributive lattices satisfy the distributive law relating join and meet
operations.

27.If a lattice has a unique least upper bound and greatest lower bound for every pair of
elements, and it is also distributive, it is called a:

a) Modular lattice

b) Boolean lattice

c) Bounded lattice

d) Complemented lattice

Answer: b) Boolean lattice

Explanation: A Boolean lattice is a distributive lattice where every element has a

28.Which property characterizes a lattice where for any elements a, b, and c, a ∨ (b ∧ c)

a) Absorption

b) Distributivity

c) Commutativity

d) Transitivity

Answer: b) Distributivity
Explanation: Distributive lattices satisfy the distributive law, which relates join and meet
operations.

29.If a lattice has a unique least upper bound and greatest lower bound for every finite
non-empty subset, it is called a:

a) Complete lattice

b) Finite lattice

c) Complemented lattice

d) Modular lattice
Answer: a) Complete lattice

Explanation: A complete lattice has all the joins and meets, even for infinite subsets.

30.What is the property that distinguishes a lattice from a partially ordered set?

a) Reflexivity

b) Antisymmetry

c) Infimum existence

d) Transitivity

Answer: c)Infimum existence

Explanation: A lattice is a partially ordered set in which every pair of elements has both
a supremum (least upper bound) and an infimum (greatest lower bound). The key
property distinguishing a lattice is the existence of infima and suprema for any pair of
elements.

© 2018-2020 dndsofthub All Rights Reserved