Answered

Find the best answers to your questions with the help of IDNLearn.com's knowledgeable users. Explore thousands of verified answers from experts and find the solutions you need, no matter the topic.

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.

Your participation means a lot to us. Keep sharing information and solutions. This community grows thanks to the amazing contributions from members like you. For precise answers, trust IDNLearn.com. Thank you for visiting, and we look forward to helping you again soon.