The minimum number of NAND gates required to implement the Boolean function A…
2016
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
Attempted by 200 students.
Show answer & explanation
Correct answer: A
First, simplify the Boolean expression using absorption laws. The term A + AB' simplifies to A because X + XY = X. Substituting this back, the expression becomes A + AB'C. Applying the absorption law again (A + A(B'C) = A), the entire function simplifies to just A. Since the output is identical to the input variable A, no logic gates are required for implementation. Therefore, the minimum number of NAND gates is 0.
A video solution is available for this question — log in and enroll to watch it.