Archives

Powered By GitBook

1: Logic

We start with the fundamentals of logic gates and logical expressions using De Morgan's Law. By looking at transistors, the most granular aspect of CS, we can steadily add layers of abstraction.

Learning Targets

I can explain the connection between electricity and logic.

I can interpret logical statements with all common operators, (i.e. and, or, nor, xor, if, iff).

I can describe the benefits of De Morgan's Laws.

Logic Gates

I'm absolutely fascinated in how people build logic, systems that react to conditions, into physical devices.

We start with two tricks with circuits:
1) and &&
2) or ||

With tiny transistors and these building blocks, we can assemble our modern technological era. Let's just take a peak:

Now you can get this joke!

De Morgan's Law

You'll need to know how to distribute the ! when simplifying logical expressions.

De Morgan's Laws essentially describes the distributive property of "not" or !

It's only false if the condition was met (you studied) but you did not get the promised result.

iff means they both have to be the same for <-> to be true

Binary

Can you see how false and true could also be considered to be 0 and 1? All the sudden, we can make these logic gates, these electrical transistors, store binary data. Computers are pretty cool.

Last modified 1mo ago

Export as PDF

Copy link