Discrete Structures and Optimization - Boolean Algebra

15. The minimum number of NAND gates required to implement the Boolean function. A + AB' + AB'C is equal to

  • Option : A
  • Explanation : y = A + AB'+AB'C = A + AB'(1+C) =A + AB' = A(1+B') =A
Cancel reply
Cancel reply