Problem #1: Using the theorem of switching algebra, simplify each of the

following given functions:

(a) F = A.B + A.B.C’.D + A.B.D.E’ + A.B.C’.E + C’.E.D
(b) F= A.B.C + D’.E’.B’ + E.F.A + D’.C.A.E’ + A.F
(c) F = A’.B.’C + A’.B.C + A.B’.C + A.B.C’

Problem #2: Draw the truth table for each of the following logic functions
(Some might need simplification first).
(a) F = A’.B + A’.B’.C
(b) F = A.B + B’.C + C’.D + D’.A
(c) F = (A.B)’ . (C’ + D’)’
(d) F = (((A+B)’ + C’)’ + D)’
(e) F = A.B + A.B’.C’ + A’.B.C
(f) F = A.B’ + B.C + A.C’

Problem #3: Write the canonical sum of product for each of the following:
(a) F = Σx,y (1,2)
(b) F = Σa,b,c (0,1,2,5,6)
(c) F = Σa,b,c,d (1,2,5,7)
(d) F = Πa,b (0,1,2)
(e) F= Πa,b,c,d (0,3,4,5,11,12)

Problem #4: Using Karnaugh maps, find a minimal sum-of-products expression

and a product-of-sum expression for each of the following logic
functions. List all prime implicants and then list all essential prime
implicants:
(a) F= Σa,b,c,d (1,4,5,6,7,9,14,15)
(b) F= Σa,b,c,d (0,2,5,7,8,10,13,15)
(c) F= Πa,b,c (0,1,3,4,5)
(d) F= Πa,b,c (0,4,6,7)

Problem #5: Using DeMorgan’s theorem, write the equivalent of the given
equations:
a) F= ((A+B) . (C+D))’
b) F = (A+B’+(C.D’)’)’
c) F = (A.B.(C’+D’))’
d) F = (A.(C+B’).(A’+D)’)’