0% found this document useful (0 votes)
28 views10 pages

Tutorial 5 (With Answers)

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
0% found this document useful (0 votes)
28 views10 pages

Tutorial 5 (With Answers)

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/ 10

UCCM1363 DISCRETE MATHEMATICS

TUTORIAL 5

1. Determine whether the relation R is a partial order on the set A.


(i) A = the set of integers and a R b if and only if a = 3b.
(ii) A = the set of integers and a R b if and only if a2 | b.
(iii) A = the set of integers and a R b if and only if a = bk for some positive
integers k.

2. Describe the ordered pairs in the relation determined by the Hasse diagram on
the set A = {1, 2, 3, 4}.
(i) 4 (ii)
4

3
3
2
2 1 1

3. Determine the Hasse diagram of the partial order having the following
digraph.
a

b e

c d

4. Determine the Hasse diagram of the relation on A = {1, 2, 3, 4, 5} whose


1 1 1 1 1
0 1 1 1 1
 
matrix is 0 0 1 1 1 .
 
0 0 0 1 1
0 0 0 0 1

5. Consider the partial order of divisibility on the set A. Draw the Hasse diagram
of the poset and determine which posets are linearly ordered.
(i) A = {1, 2, 3, 5, 6, 10, 15, 30}
(ii) A = {2, 4, 8, 16, 32}
(iii) A = {3, 6, 12, 36, 72}
(iv) A = {1, 2, 3, 4, 5, 6, 10, 12, 15, 30, 60}.

1
UCCM1363 DISCRETE MATHEMATICS

6. Give a topological sorting of the each of the following posets.


(i) 8 (ii) 9
7 7 8
5 6 2 3 6
4 1 5
2 3 4
1

7. Determine all maximal and minimal elements of the following posets:


(i) (ii) f g
3 5
4
2 d e
1 6
a b c

(iii) e f (iv)
4 7
d
3 6
c 5
b 2 8

a 1 9
(v) A = ℝ with the usual partial order .
(vi) A = {x | x is a real number and 0  x < 1} with the usual partial order .
(vii) A = {x | x is a real number and 0 < x  1} with the usual partial order .
(viii) A = {2, 3, 4, 6, 8, 24, 48} with the partial order of divisibility.

8. Determine the greatest and least elements, if they exist, of the following
posets.
(i) f (ii) e
d e d

c
b c
a b
a

(iii) (iv) 5

4 5
3 4
2 3
1 2
1

2
UCCM1363 DISCRETE MATHEMATICS

(v) A = {x | x is a real number and 0 < x < 1} with the usual partial order .
(vi) A = {x | x is a real number and 0  x  1} with the usual partial order .
(vii) A = {2, 4, 6, 8, 12, 18, 24, 36, 72} with the partial order of divisibility.
(viii) A = {2, 3, 4, 6, 12, 18, 24, 36} with the partial order of divisibility.

9. Find, if they exist, (a) all upper bounds of B; (b) all lower bounds of B; (c) the
least upper bound of B; (d) the greatest lower bound of B.
(i) (ii)
g h 4 5
f 3
d e
1 2
c
a b
B = {c, d, e} B = {1, 2, 3, 4, 5}

(iii) f (iv)
5 8
e 6
4 9
d 3
c 7
b 1 2

a
B = {b, c, d} B = {3, 4, 6}

(v) (A, ) is the poset in (i); B = {b, g, h}.

(vi) (a) (A, ) is the poset in (iv); B = {4, 6, 9}


(b) (A, ) is the poset in (iv); B = {3, 4, 8}

(vii) A = ℝ and  denotes the usual partial order;


B = {x | x is a real number and 1 < x < 2}.

(viii) A = ℝ and  denotes the usual partial order;


B = {x | x is a real number and 1  x < 2}.

10. Give an example of a partial order on A = {a, b, c, d, e} that has two maximal
elements and no least element.

11. Let A = {2, 3, 4, …, 100} with the partial order of divisibility.


(a) How many maximal elements does (A, ) have?
(b) Give a subset of A that is a linear order under divisibility and is as
large as possible.

3
UCCM1363 DISCRETE MATHEMATICS

12. Let the relation R be defined by the Hasse diagram as follows:


a
b
c d
e

(i) Complete the following tables for R.

GLB a b c d e
a
b
c
d
e

LUB a b c d e
a
b
c
d
e

(ii) Is R a lattice? Explain.


(iii) Is R complemented? Explain.

13. Determine whether the Hasse diagram represents a lattice.


g
(i) e f (ii)
h f
d
c d e
a b c

a b

(iii) g (iv) g

e e f
f d
d
b b c
c
a a

4
UCCM1363 DISCRETE MATHEMATICS
14. Is the poset A = {2, 3, 6, 12, 24, 36, 72} under the relation of divisibility a
lattice?
15 Determine whether each lattice is distributive, complemented, or both.
(i) e (ii) f
d
c f g
c e
b d
b
a
a

(iii)
e
d
c
b
a

16. Determine whether the poset is a Boolean algebra. Explain.


(i) f (ii) e

d e d
c
b c b
a a

h h
(iii) (iv)

f g f g
e
e
b d c
b c d
a

a
17. Consider the Boolean polynomial p(x, y, z) = (x  y)  (z  x'). If B = {0, 1},
compute the truth table of the function f: B3  B defined by p.

18. (i) Show that x  (y  (y'  (y  y'))) = x.


(ii) Show that ((x  z)  (y'  z)')  ((y  z )  (x  z')) = x  y.

5
UCCM1363 DISCRETE MATHEMATICS

19. Consider the function boolean f whose truth table is shown below.
x y z f(x, y, z)
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1
Show that f is produced by the Boolean expression z  (x  y).

6
UCCM1363 DISCRETE MATHEMATICS

Solution 5
1. (i) R is not reflexive because 1 is not related to itself. Therefore R is not a
partial order.

(ii) R is not reflexive because 2 is not related to itself. Therefore R is not a


partial order.

(iii) a = a1  a  A, so R is reflexive.
If a R b and b R a, then a = bk and b = al, so a = akl and hence kl = 1
which implies k = l = l.
So a = b and R is antisymmetric.
If a R b and b R c, then a = bk and b = cl and therefore a = ckl.
So a R c and R is transitive.
R is a partial order on A.

2. (i) R = {(1, 1), (2, 2), (3, 3), (4,4 ), (1, 3), (2, 3), (3, 4), (2, 4), (1, 4)}.

(ii) R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3,
4)}.

3. a

e
b
d
c

4.
5
4

2
1

5. (i) (ii)
30 32
16
10 15
6 8

2 5 3 4
2
1

7
UCCM1363 DISCRETE MATHEMATICS

(iii) (iv)
72 60
36 12 30
10 15
12 4 6
6 2 5
3
3 1

6. (i) 1, 3, 2, 4, 6, 5, 7, 8
(ii) 4, 1, 2, 3, 5, 6, 7, 8, 9

7.
(i) (ii) (iii) (iv) (v) (vi) (vii) (viii)
Maximal 3, 5 f, g e, f 4, 7 - - 1 48
Minimal 1, 6 a, b, c a 1, 8, 9 - 0 - 2, 3

8.
(i) (ii) (iii) (iv) (v) (vi) (vii) (viii)
Greatest f e - 5 1 1 72 -
Least a - - - 0 0 2 -

9.
(i) (ii) (iii) (iv) (v) (vi)(a) (vi)(b) (vii) (viii)
(a) f, g, h - d, e, f 5 - - - [2, ) [2, )
(b) a, b, c - a, b 1, 2, 3 b - 1, 2, 3 (, 1] (, 1]
(c) f - d 5 - - - 2 2
(d) c - b 3 b - 3 1 1

10. c d
b

a e

11. (a) 50
(b) {2, 4, 8, 16, 32, 64}

12. (i)
GLB a b c d e
a a b c d e
b b b c d e
c c c c e e
d d d e d e
e e e e e e

8
UCCM1363 DISCRETE MATHEMATICS
LUB a b c d e
a a a a a a
b a b b b b
c a b c b c
d a b b d d
e a b c d e

(ii) It is a lattice because LUB and GLB exist for all pairs of elements.

(iii) It is not complemented because b' does not exist.

13. (i) is not a lattice because LUB of e and f does not exist.
(ii) is not a lattice because GLB of a and b does not exist.
(iii) and (iv) are lattices because LUB and GLB exist for all pairs of elements.

14. No, because GLB of 2 and 3 does not exist.

15. (i) is not distributive because it contains a sublattice which is not distributive.
(i) is not complemented because d' does not exist.

(ii) is not distributive because it contains a sublattice which is not distributive.


(ii) is not complemented because d' does not exist.

(iii) is distributive and it is not complemented because b' does not exist.

16. (i) is not a Boolean algebra because |L| = 6  2n for all nonnegative integers n.
(ii) is not a Boolean algebra because |L| = 5  2n for all nonnegative integers n.
(iii) is a Boolean algebra because it is isomorphic to B3.
(iv) is not a Boolean algebra because it is not isomorphic to B3 even |L| = 8.

17.
x y z (x  y)  (z  x')
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

18. (i) x  (y  (y'  (y  y'))) = x  (y  (y'  I))


= x  (y  y')
=xI
=x

9
UCCM1363 DISCRETE MATHEMATICS
(ii) ((x  z)  (y'  z)')  ((y  z )  (x  z'))
= ((x  z)  (x  z')  ((y  z )  (y'  z)')
= ((x  (z  z'))  ((y  z )  (y  z'))
= (x  I)  ((y  (z  z'))
= x  (y  I)
=xy

19. S(f) = {(0, 1, 1), (1, 0, 1), (1, 1, 1)}.

The Boolean expression is


E(0, 1, 1)  E(1, 0, 1)  E(1, 1, 1)
= (x'  y  z)  (x  y'  z)  (x  y  z)
= [(x'  x)  (y  z)]  [(y'  y)  (x  z)]
= [I  (y  z)]  [I  (x  z)]
= (y  z)  (x  z)
= (x  y)  z
= z  (x  y)

10

You might also like