search
Log In
0 votes
189 views

Given circuit is to be implemented with minimum number of 2 input NAND & NOR Gates.. Tell the minimum number of NAND NOR GATES required.. 

  1. 1,4
  2. 4,1
  3. 2,4
  4. None
in Digital Logic 189 views
0
2,4?
0
No it's 1,4 but I don't know how ?
0
Then ans is wrong, or None

as we can produce this circuit in even 2 nor and 1 NAND GATE but i went with the ansof 2,4 as we can also do that,
0
How did you make it with 2 NOR?

2 Answers

4 votes
 
Best answer

$((XY')' YZ)'$

$= XY' + Y' + Z'$

$= Y'(1+X) + Z'$

$= Y' +Z'$

$= (YZ)'$

$\therefore$ we need only $1$ NAND gate to implement the above circuit.

Also we can make NAND gate using $4$ NOR gates.

So we need $4$ NOR gates to implement the above circuit.

$\therefore$ Option $A$ is the correct answer.


selected by
0
Can you please help me in understanding the concept of these circuits ? Specially the NOR circuit.. this is really confusing
0
watch the video lectures of neso academy on youtube.

NOR and NAND are universal gates so you can make any circuit from it. thats why in such questions they ask how many nand or nor gates are required to make the circuit.

first write the equation of the given circuit

then just try to convert the equation in terms of (xy)' or (x+y)' i.e. Not AND and Not OR forms and then count how many (xy)' or (x+y)' are there in the equation. This will be equal to the number of gates required.
1 vote

Solution:-

Related questions

0 votes
1 answer
2
416 views
Assume the operands are in 2’s Complement. To decrement A by 1, lines K,Cn and B should be : K = 1 , Cin = 1 , B = 1 K = 0 , Cin = 1 , B = 1 K = 0 , Cin = 1 , B = 0 K = 1 , Cin = 0 , B = 0
asked Jan 16, 2019 in Digital Logic Na462 416 views
...