How many gate(s) would be required to implement the following boolean expression after simplification? Expression: A’(C’D’ + C’D) + AB(C’D’ + C’D) + AB’C’

How many gate(s) would be required to implement the following boolean expression after simplification? Expression: A’(C’D’ + C’D) + AB(C’D’ + C’D) + AB’C’ Correct Answer 1

Boolean expression is: A’(C’D’ + C’D) + AB(C’D’ + C’D) + AB’C’

In simplified form it will be:

= A’ + AB + AB’C’

= A’ + ABC’ + AB’C’                                // As, A + A’ = 1

= A’C’ + AC’(B + B’)

= A’C’ + AC’

= C’(A + A’)= C’
[ alt="F1 Raju.S 26-08-2020 Savita D1" src="//storage.googleapis.com/tb-img/production/20/08/F1_Raju.S_26-08-2020_Savita_D1.png" style="width: 212px; height: 85px;">

Therefore, not gate is enough to represent the given Boolean expression.

Related Questions

Calculate the minimum number of AND gates, OR gates and NOT gates required to realize Exclusive-OR operation if only using AND, OR and NOT gates are allowed.