Answered

Welcome to Westonci.ca, the place where your questions are answered by a community of knowledgeable contributors. Our platform offers a seamless experience for finding reliable answers from a network of knowledgeable professionals. Explore comprehensive solutions to your questions from knowledgeable professionals across various fields on our platform.

given the Boolean expression for F(A,B,C)
F(AB,C) = AB+ ABC
. How many binary input comibinations are there for the output funtion F(A,B,C) to be 1

Sagot :

No of variables in Boolean expression is 3 i.e A,B,C

  • n=3

Number of input combinations.

[tex]\\ \sf\longmapsto 2^n[/tex]

[tex]\\ \sf\longmapsto 2^3[/tex]

[tex]\\ \sf\longmapsto 8[/tex]

It will follow the octal table.

000

001

010

011

100

101

110

110

We know the rule .

  • If there is 1 present then output comes 1.
  • Only 000 has no 1s

So

no of outputs which are 1=8-1=7.

Thanks for stopping by. We are committed to providing the best answers for all your questions. See you again soon. We appreciate your visit. Our platform is always here to offer accurate and reliable answers. Return anytime. Thank you for trusting Westonci.ca. Don't forget to revisit us for more accurate and insightful answers.