Question

Q1. Minimize the given Boolean Expression by using the four variable k-map with the Don’t Care conditions and draw the circuit.

F (A, B, C, D) = Σ m (1, 5, 6, 10, 11, 12)+d(2,4).

Implement the circuit before and after the minimization.

Answer 1

$F(A,B,C,D)=\sum m(1,5,6,10,11,12)+ d(2,4)$

Truth Table:

K Map :

K-map of the above truth table can be formed as

So from the K-Map we can form logic expression as:

$Y=A'C'D + AB'C + BC'D' + A'CD'$

and circuit can be formed as: