De Morgan's Law

From TRCCompSci - AQA Computer Science

Revision as of 20:24, 5 March 2017 by AJackson (talk | contribs) (Created page with "DeMorgan's laws are the laws of how a NOT gate affects AND and OR statements. They can be easily remembered by "break the line, change the sign". The following image is how to...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to: navigation, search

DeMorgan's laws are the laws of how a NOT gate affects AND and OR statements. They can be easily remembered by "break the line, change the sign". The following image is how to prove De Morgan's Law...

Retrieved from ‘http://www.trccompsci.online/mediawiki/index.php?title=De_Morgan%27s_Law&oldid=1796’