Digital Logic and Circuits

Tutorial-3

1. Obtain the simplified expressions in product of sums:

(a) F(w,x,y,z) = ∏ (0,1,2,3.4,10,11)
(b) F(A,B,C,D) = ∏ (1,3,5,7,13,15)
(c) F = (A+B’+D)(A’+B+D)(C+D)(C’+D’)
(d) F(A,B,C,D) = Σ(2,3,12,13.14,15)
(e) F = (A’+B’+D)(A’+D’)(A+B+D’)(A+B’+C+D)
2. Simplify the Boolean function F using don’t care condition in SOP and POS
and implement using NAND and NOR gates
(a) F = A’B’D’ + A’CD + A’BC
d = A’BC’D +ACD +AB’D’
(b) F = ACE + A’CD’E’ + A’C’DE
d = DE’ + A’D’E + AD’E’
3. Simplify the following Boolean functions using Tabulation Method
(a) F(A,B,C,D,E,F) = Σ(6,9,13,18,19,25,27,29,41,45,57,61)
(b) F = B’DE’ + A’BE + B’C’E’ + A’BC’D’
d = BDE’ + CD’E’