Question

Minimize the following Boolean function using K-map
method F (A, B, C, D) - Em10, 2, 3, 8, 10, 11, 12, 14)​

Answer 1

Answer:

• The minimization will result in reduction of the number of gates

(resulting from less number of terms) and the number of inputs

per gate (resulting from less number of variables per term)

• The minimization will reduce cost, efficiency and power

consumption.

• y(x+x`)=y.1=y

• y+xx`=y+0=y

• (x`y+xy`)=xy

• (x`y`+xy)=(xy)`