5.2k views

What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates?

1. $2$
2. $3$
3. $4$
4. $5$
edited | 5.2k views

Given boolean function is

f$= AB + C$

$= (A+C) . (B +C)$

$=((A+C)' +(B+C)')'$

Therefore, $3$ NOR gate required .

Correct Answer: $B$

edited
0
Silly question but
Where is this rule written AB+C = (A+c)(B+C)

I just can figure out by looking at the question also never found this rule before anywhere.
0

It is a rule you can check it by using truth table or look into morris mano postulate 4, distributive (b)

0
beautiful explanation.
Answer should be 3 nor gates...A.B + C can be written as (A+C).(B+C) which is a OR-AND realization and can be made with 3 NOR gates as OR- AND is similar to a NOR-NOR realization...
edited

Option : B

Solution:

Almost same solution,

AB + C = ((AB + C)')' = ((AB)'C')' = ((A' + B')C')' = (A' + B')' + C

two NOR gates for complementing A and B

one for computing (A' + B')'

one to compute ((A' + B')' + C)'

one to negate the last result

1
2