Scribd
Upload
8 views2 pages

Lattice Theory and Boolean Algebra Exercises

This document outlines a series of questions related to lattice theory and Boolean algebra, including proofs, simplifications, and diagram constructions. It covers topics such as distributive lattices, unique complements, and the properties of partial orders. Additionally, it includes exercises on finding least upper bounds (LUB) and greatest lower bounds (GLB) within various sets.

Uploaded by

v.kanishkumar7777
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views2 pages

Lattice Theory and Boolean Algebra Exercises

This document outlines a series of questions related to lattice theory and Boolean algebra, including proofs, simplifications, and diagram constructions. It covers topics such as distributive lattices, unique complements, and the properties of partial orders. Additionally, it includes exercises on finding least upper bounds (LUB) and greatest lower bounds (GLB) within various sets.

Uploaded by

v.kanishkumar7777
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

UNIT - V

[Link] Question Mark COs


s
1. 1Show that in a lattice if 𝑎 ≤ 𝑏 ≤ 𝑐 , then (i) 𝑎⨁𝑏 = 𝑏 ∗ 𝑐
10 5
(ii) (𝑎 ∗ 𝑏)⨁(𝑏 ∗ 𝑐) = 𝑏 = (𝑎⨁𝑏) ∗ (𝑎⨁𝑐)
Let (L,˅, ˄ ) be given Lattice. Then, for any a,b,c  L , a  (a  b)  a, and 10 6
2. 2
a  (a  b)  a
3. 1In a distributive lattice (L,˅, ˄ ), Prove that the complement of each element is 10 5
3unique.
4. 1Simplify the Boolean expressions using Boolean algebra: 10 6
4 1. a'b(a'+c)+ab'(b'+c). 2. 𝑎′.𝑏′.c+a.𝑏′.c+𝑎′.𝑏′.c’
Draw the Hasse diagram for (i) P1 = {1, 2, 3, 4, 12} and ≤ is a relation such that 10 5
5. 1x ≤ y if 𝑥 divides 𝑦. (ii) Let S = {a, b, c} and à = P(S) = {ϕ, {a}, {b}, {c}, {a,
7b}, {a, c}, {b, c}, {a, b, c}}. Consider the partial order relation of set inclusion
(⊆).
Find the product of max-terms of the Boolean expression 10 6
6. 21. 𝐹(𝑥, 𝑦, 𝑧) = 𝑥𝑦𝑧,
12. F(x,y,z) = x+y+z and
3. 𝐹(𝑥, 𝑦, 𝑧) = 𝑥 + 𝑦′𝑧 by truth table method and algebraic method.
7. 2If S42 is the set of all divisors of 36 and D is the relation “divisor of” on S36, 10 5
5prove that {S36, D}is a complemented Lattice.
8. 2Draw the Hasse diagram for D105 and / is a partial order relation also find (i) 10 5
The GLB of 5 and 15 (ii) The LUB of
6
5 and 15 (iii) all the lower bounds and upper bounds of 5 and 15
9. 2 the POSET {3,5,9,15,24,45} using the relation / , Find (i) the minimal and
For 10 5
maximal elements (ii) the greatest and least elements. (iii) upper bounds and
7
LUB of {3,5}.
10. 2Draw the Hasse diagram for D60 and / is a partial order relation also find (i) 10 5
The GLB of 6 and 10 (ii) The LUB of
8
6 and 10 (iii) all the lower bounds of 6 and 10
11. 3 Simplify (a*b)'⊕(a⊕b)' (ii) (a'*b'*c)⊕ (a*b'*c)⊕(a*b'*c') 10 5
3 (2) In a Boolean algebra prove that
. (𝑖)𝑎 ∗ (𝑎 ⊕ 𝑏) = 𝑎, (𝑖𝑖) 𝑎 ⊕ (𝑎 ∗ 𝑏) = 𝑎 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎, 𝑏 ∈ 𝐵
Let L is a lattice, where 𝑎 ∗ 𝑏 = (𝑎, 𝑏) and 𝑎 ⊕ 𝑏 = (𝑎, 𝑏) for all 𝑎, 𝑏 ∈ 𝐿.Show 10 5
12. 3that both binary operations * & ⊕ defined as in L satisfies commutative,
4associative, absorption.

10 5
13. 3Determine whether the poset (i) ({1,2,3,4,5}./) is a Lattice and (ii) Consider
5X={1,2,3,4,6,12},/) , R= (a, b)  a / b . Find LUB and GLB for the Poset.

14. 3 Prove that the product of 2 lattice is also a lattice 10 5


7 If (L, , ) & (H , , ) are 2 lattices, then P.T (L x M, . , +) is also a lattice.
10 6
15. 4Prove that D110 , the set of all positive divisors of 110, is a Boolean algebra and
0find all its sub algebras. Lub and glb of (5,10) and (11,22)

You might also like