Question

Consider the following k-map and derive minimum number of NAND/NOR gates to implement the below drawn k-map
​

Answer 1

Answer:

He's been told to perform Karnaugh map minimization. ... Why use only NAND gates or only NOR gates? ... Off the top of my head, I can think of the following reasons for

Answer 2

NAND and NOR gates are the universal gates.

All basic gates (AND , OR , NOT) can be designed using these two gates.

NAND gate is negation of AND gate whereas NOR gate is negation of OR gate.

AND + NOT = NAND

OR + NOT = NOR

Truth Table of NAND gate

x y    x NAND y

0 0        1

0 1         1

1 0         1

1 1          0

Truth Table of NOR gate

x y    x NOR y

0 0        1

0 1         0

1 0         0

1 1          0