De Morgan's Law

From TRCCompSci - AQA Computer Science

Revision as of 09:46, 23 March 2017 by Admin (talk | contribs)

(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...

The Process

Step 1 - Reverse the sign

Step 2 - Negate each term

Step 3 - Negate the whole expression

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