Scribd
Upload
25 views1 page

Tutorial 4 BMAT205L

Uploaded by

sirgounike
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
25 views1 page

Tutorial 4 BMAT205L

Uploaded by

sirgounike
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
You are on page 1/ 1

Fall semester 24-25

Tutorial sheet-4
Course code: BMAT205L
Course Title: Discrete Mathematics and Graph theory

1. Check whether the following relation is a partial ordered set,


𝑏
a) R is the relation on the set A = {1, 2, 4, 6, 8} defined by aRb if and only if is
𝑎
an integer.
b) for any real numbers a and b, aRb if and only if a≤𝑏 3 .
2. For the poset [{3, 5, 9, 15, 24, 45}; divisor of], find
a) the maximal and minimal elements
b) the greatest and the least elements
c) the upper bounds and LUB of {3, 5}
d) the lower bounds and GLB of {15, 45}.
3. Show that the set {2,3,6,12}, under the relation "multiple of," forms a lattice. Draw the
Hasse diagram and find the greatest lower bound and least upper bound for the
elements 6 and 12.
4. Determine whether the following posets are lattices:
a) {(1, 3, 6, 9, 12), D}
b) {(1, 5, 25, 125), D},
where D denotes the relation ‘division’. If a poset is not a lattice, give reasons.
5. Draw the Hasse diagram for the power set P(S) of the set S = {a, b, c, d}, ordered by
the subset relation, and identify the maximal, minimal, greatest, and least elements of
the poset. Also, find the greatest lower bound and least upper bound for the subsets {a}
and {b, c}.
6. Reduce the Boolean expression: A = XY + X(Y+Z) + Y(Y+Z) using Boolean algebra
properties.
7. Prove the following Boolean identities:
a) a . (a′ + b) = a . b
b) a . b + a . b′ = a
8. Simplify the following expressions using Boolean algebra:
a) a′ b (a′+ c) + ab′ (b′+ c)
b) a + a′ bc′+ (b + c) ′
9. Find the disjunctive normal forms of the Boolean expression f (x, y, z) = (x′y) ′ (x + y)
using (a) truth table method and (b) algebraic method.
10. Find the conjunctive normal forms of the Boolean expression f (x, y, z) = xz + x′y + yz
using (a) truth table method and (b) algebraic method.

You might also like