Difference between revisions of "De Morgan's Law"

From TRCCompSci - AQA Computer Science
Jump to: navigation, search
Line 1: Line 1:
 +
__NOTC__
 
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...
 
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...
  

Revision as of 10:08, 10 March 2017

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