The minimum number of NAND gates required for implementing the Boolean…
2022
The minimum number of NAND gates required for implementing the Boolean expression AB + AB'C + AB'C' is:
Answer: B. 0 — AB + AB'C + AB'C' = A(B + B'C + B'C') = A(B + B'(C + C')) = A(B + B') = A. Since the expression reduces to a single input A, no NAND gate is required.
- A.
1
- B.
0
- C.
2
- D.
3
Attempted by 96 students.
Show answer & explanation
Correct answer: B
AB + AB'C + AB'C' = A(B + B'C + B'C') = A(B + B'(C + C')) = A(B + B') = A. Since the expression reduces to a single input A, no NAND gate is required.
Loading lesson…