Question

Draw the simplified logic diagram using only NAND gates to implement the three input function F denoted by the expression : F = ∑(0, 1, 2, 5)

Answer 1

There are two pairs that reduces as given below:

Pair-1(m₀ + m₂) reduces to a’c’

Pair-2(m₁ + m₅) reduces to b’c Simplified Boolean expression for given K- map is

F(A,B,C) = a’c’ + b’c