Lab 7 Task 3

For Task 3, we must prove through Logic Gates that DeMorgan's Law is true. For this I was able to create the following circuit in the Logic Gate Simulator:



After running different values of A and B on the circuit I was able to form the following truth table, proving DeMorgan's Law true:

A	B	NOT A	NOT B	A AND B	NOT (A AND B)	NOT A OR NOT B
0	0	1	1	0	1	1
0	1	1	0	0	1	1
1	0	0	1	0	1	1
1	1	0	0	1	0	0

As you can see from the red numbers, NOT (A AND B) is the equivalent of NOT (A OR B), therefore proving that DeMorgan's Law is true.