De Morgan's Law

From TRCCompSci - AQA Computer Science
Revision as of 12:42, 9 May 2018 by Admin (talk | contribs) (→‎Example 2)
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...

Capture3.jpg

The Process

Step 1 - Reverse the sign

Step 2 - Negate each term

Step 3 - Negate the whole expression

How to apply

Example 1

[math] \overline{(\overline{A+B})+B} [/math]

Example 2

[math](\overline{A+\overline{B}).\overline{A}}[/math]

Example 3

Example 4

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