TUTORIAL 11

1. Show that in a Boolean algebra for any a, b and c .

(a)   a  c    b ' c   '   a ' b   c '

(b)  a  b    a  b '  a

2. Find the values of these expressions.

(a) 1 0 (b) 11
(c) 00 (d) 1  0 
3. Construct the truth table for the Boolean function determined by

 
(a) f  x, y, z    x  y   y  z

(b) f  x, y , z   x   y  z 

(c) f  x, y , z    x  y    z  x 

(d) f  x, y, z   x  yz

(e) f  x, y, z   x y  xyz 
(f) f  x, y , z   x  yz  y z 

4. Construct Karnaugh maps for the functions whose truth table are given. Then write the
Boolean expression from the maps.
(a) nnnx y f(x,y) (b) x y f(x,y)
0 0 1 0 0 1
0 1 0 0 1 0
1 0 0 1 0 1
1 1 1 1 1 0

(c) mmmmmm
x y z f(x,y,z) (d) x y z f(x,y,z)
0 0 0 1 0 0 0 0
0 0 1 1 0 0 1 1
0 1 0 0 0 1 0 1
0 1 1 0 0 1 1 1
1 0 0 1 1 0 0 0
1 0 1 0 1 0 1 0
1 1 0 1 1 1 0 0
1 1 1 0 1 1 1 1

5. Construct a logic diagram implementing the function f of Question 3.

Prepared by WFH 2019

6. Find the output of the given circuit. If possible minimize the Boolean function and sketch
the simplified functions.
(a)

(b)

(c)

Prepared by WFH 2019