Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

UNIVERSITI TUNKU ABDUL RAHMAN

Faculty : Lee Kong Chian Faculty of Course Code : UEEA1323/UEEP1323


Engineering and Science
Program : 3E, EC, ET, PH, MH, BI, MM Course Name : Digital Electronics

Tutorial 2: Boolean Algebra and Minimization

1. Write the output expression for each circuit as it appears in Figure 1.

2. Implement the following logic expressions using AND gates, OR gates and
inverters as needed.
(a) Y = AB + B(A + C)
(b) Y = (A + B) (C + D)

3. Prove using truth table (xyz) = x + y + z and abc + abc + abc = ac + bc.

4. Simplify the following expressions by applying the appropriate theorems, laws or


rules of Boolean algebra.
(a) xyz + xy + xyz
(b) (A + B)(A + B)
(c) (AB + CD)(BE + CD)
(d) (A + BC)(DE + F)+(DE + F)
(e) WXY + WXZ + WYZ + WZ
(f) [(a + d + bc)(b + d + ac)] + bcd + acd (reduce to three terms)
(g) AC + BC + AB + ABD + BCD + ACD

5. Prove algebraically:
(a) (X+Y)(X Z) + (X+Y)(XZ) = (XY) + Z
(b) ABC + ACD + ABD + ACD = (A+C)(A+D)(B+C+D)

6. Is the distributive law A  BC = (A  B)(A  C) valid? Prove your answer


algebraically.

7. Given that F = XY + XY + YZ, implement it using


(a) OR and NOT gates
(b) AND and NOT gates.

1
8. Convert the following into sum of products and product of sums forms.
(a) (AB + C)(B + C D)
(b) X + X(X + Y)(Y + Z)

9. Obtain the minimum SOP of the following expressions algebraically.


(a) (A + B + C + D)(A + B + C + D)(A + C)(A + D)(B + C + D)
(b) [(A + B) + (ABC) + CD]

10. Obtain the minimum POS for BCD + CD + BCD + CD algebraically.

11. Reduce
(a) (X + W)(Y Z) + XW to a three-term SOP form
(b) (A  BC) + BD + ACD to a four-term SOP form.

12. Given f(a,b,c,d) = ∑ m(1,3,6,7)


(a) Derive the truth table for f.
(b) Express f in canonical SOP form.
(c) Derive the canonical POS form of f from the truth table in (a).
(d) Give the complement of f as a maxterm expansion.

13. (a) Given F1 = ∑m(0,4,5,6) and F2 =∑m(0,3,6,7), find the minterm expression
for F1 + F2.
(b) Given G1 = ∏M(0,4,5,6) and G2 = ∏M(0,3,4,6,7), find the maxterm
expression for G1G2.

14. Given f(a,b,c) = a(b + c)


(a) Write f as a minterm expansion and maxterm expansion
(b) Write f as a minterm expansion and maxterm expansion

15. Given the following truth table:

A B C F1 F2 F3 F4
0 0 0 1 1 0 1
0 0 1 X 0 0 0
0 1 0 0 1 X 0
0 1 1 0 0 1 1
1 0 0 0 1 1 1
1 0 1 X 0 1 0
1 1 0 0 X X X
1 1 1 1 X 1 X

Find the simplest expression for F1 in both SOP and POS forms. Specify clearly
the values assigned for the don’t care terms that lead to the expression.

Repeat for F2, F3 and F4.

You might also like