how do we implement any given circuit with the help of NAND and NOR gates??
Truth table, Karnaugh map, reduced SOP form equation, gates.
Sorry i didn't cleared my question.. I am feeling stupid..
Actually i wanted to ask that if a logic diagram is already implemented with AND and OR gates, then how to convert it or implement it with Nand and Nor gates??
You use De Morgan's Law and principals like double negation to translate one into another. Boolean Algebra has some more info.
Separate names with a comma.