The minimum number of NAND gates required to implement the Boolean function A + AB’+ AB’C is equal to
Explanation: A + AB’+ AB’C
=A(1+B’) + AB’C
=A + AB’C
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
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.