Grade 7
Simplify Boolean expressions using AND, OR, NOT, and De Morgan's laws. Complete the interactive challenge to master key computing concepts!
De Morgan's Law proves that taking the inverse of a sum (NOT OR) gives the same outputs as taking the product (AND) of two inverted inputs.
| A | B | TARGET (NOT OR) | CURRENT CIRCUIT |
|---|---|---|---|
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 |
Tip: Click any row to test that combination.