The minimum number of NAND gates required to implement the Boolean function A + AB’+ AB’C is equal to
(A) 0
(B) 1
(C) 4
(D) 7
Answer: (A)
Explanation: A + AB’+ AB’C
=A(1+B’) + AB’C
=A + AB’C
=A(1+B’C)
=A
So, no extra gate is required. Correct option is (A)
Quiz of this Question
Please comment below if you find anything wrong in the above post