How many gate(S) would be required to implement the following Boolean expression after simplification? Expression : AC + ABC

How many gate(S) would be required to implement the following Boolean expression after simplification? Expression : AC + ABC Correct Answer 1

Let F  = AC + ABC

F = AC (1 + B)

F = AC.(1)

F = AC

[ alt="F1 Raju Shraddha 13.10.2020 D4" src="//storage.googleapis.com/tb-img/production/20/10/F1_Raju_Shraddha_13.10.2020_D4.png" style="width: 89px; height: 40px;">

Truth Table For AND Gate

A

C

A.C

0

0

0

0

1

0

1

0

0

1

1

1

 

Therefore one 2-input AND gate is required to implement a simplified 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.