Question

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

Answer 1

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

• n=3

Number of input combinations.

`\\ \sf\longmapsto 2^n`

`\\ \sf\longmapsto 2^3`

`\\ \sf\longmapsto 8`

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.