10B11Ec401 - Digital Electronics Tutorial Sheet - 4
10B11Ec401 - Digital Electronics Tutorial Sheet - 4
Tutorial Sheet 4
1. Use Karnaugh maps to simplify the following expressions
a) f (A,B,C,D) = ABC +BCD + AC + ABCD
b) f (A,B,C,D) = ABC +BCD + AC + BC
2. Find out the minimal Boolean expression for the function given
below by K-map
a) f (A,B,C,D) = m ( 1,3, 6,7,9,13,14,15)
b) f ( W,X,Y,Z) = m ( 0,1,2,3,4,7,8,11,12,14,15)
3. Find out the minimal Boolean expression for the function given
below by K-map
a) f ( A,B,C,D) = M ( 4,6,12,13,14,15)
b) f ( A,B,C,D) = M (0,1,2,3,4,7,8,11,12,14,15)
4. Find out the minimal Boolean expression for the function given
below by K-map
a) f (A,B,C,D) = m ( 1,3, 7,11,15) + d(0,2,5)
b) f ( A,B,C,D) = M (4,,6,7,8,12) . d (1,2,3,9,11,14)
5. Find out the set of prime implicants from the given functions. Also
obtain the minimal expression using K map
a) f ( W,X,Y,Z) = m ( 0,1,2,5,7,8,9,10,13,15)
b) f ( W,X,Y,Z) = m ( 0,1,2,3,4,6,8,9,10,11)
6. Simplify the given logic function using Quine- McCluskey
minimization technique
f ( A,B,C,D) = m ( 0,1,3,7,8,9,11,15)