Question

Minimum number of 2-input NAND gates required to implement the Boolean function given below is _______.

$f=(\overline{A}+\overline{B})(C+D)$

• A. 4

Answer 1

The correct option is A 4
$f=(\overline{A}+\overline{B})(C+D)$

$=\overline{AB}(C+D)=\overline{AB}.C+\overline{AB}D$

$=\overline{\overline{\overline{AB}C+\overline{AB}D}}$

$=\overline{\overline{\overline{AB}C}.\overline{\overline{AB}D}}$