-
What is the minimum number of NAND gates required to implement A + AB + AB C?
-
- 0
- 1
- 4
- 7
Correct Option: A
Given, F = A + AB + ABC
or F = A (1 + B) + ABC
or F = A + ABC [since 1 + B = 1]
or F = A (1 + BC)
or F = A [since 1 + BC = 1)
Therefore, minimum number of NAND gate required to implement F = A is zero.
