The Boolean function $F(A,B,C)$ is defined by the minterms $\Sigma m(1,2,4,5,6,7)$.\n(a) Simplify $F$ to a minimal sum‑of‑products expression.\n(b) Using only NAND gates, determine the minimum number of NAND gates required to implement the simplified expression.

Question

Accepted Answer

Simplified expression: F = A + \overline{B}C + B\overline{C}; Minimum NAND gates required: 6

Neco 2021 Data Processing Question 43

The Boolean function \(F(A,B,C)\) is defined by the minterms \(\Sigma m(1,2,4,5,6,7)\).\n(a) Simplify \(F\) to a minimal sum‑of‑products expression.\n(b) Using only NAND gates, determine the minimum number of NAND gates required to implement the simplified expression.

Answer Options

About This Question

Master the Exam!