linhnguyen3120102418 linhnguyen3120102418
  • 02-10-2021
  • Engineering
contestada

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

Respuesta :

Аноним Аноним
  • 02-10-2021

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.

Answer Link

Otras preguntas

The difference of 10 and a number is negative eight
The inscription on the Lincoln Memorial comes from which document? the Gettysburg Address the Declaration of Independence the Emancipation Proclamation the Bill
10:2 in simplest form
or inequalities. Greater Than, >, and Less Than, <, mean the solution does NOT contain the number. So would you use and open circle or a closed circle t
Each week leslie jogs 20 minutes for every 10 minutes that she lifts weights. Is the number of minutes Leslie jogs each week proportional to the number of minut
Is St. Louis Cathedral post-modern or classical ?
Justin and Desiree each wrote a ratio comparing the numbers of students and tables in their classroom. There are 6 tables in the room with 4 students at each ta
3/4(3z+6) - 1/4(5z - 24)
9/34 × 17/6 = PLEASE HELP
When setting a purpose for a text, how can you determine what kind of text it is?