This page was last updated on March 13th, 2020(UTC) and it is currently May 30th, 2023(UTC).
That means this page is 3 years, 78 days, 9 hours, 17 minutes and 16 seconds old. Please keep that in mind.
07 - Basic Logic
Below are more gates and their abstractions. You should take note of the pattern, the "NOT" versions are on the right, and they all have a circle before their output line. Now, what you'll want to look up, if you want to see the transistors, is "transistor X gate" where "X" represents the gate you want to see. XOR has a few different versions, and the easiest to read version I saw was using 4 NAND gates. As you should see more than ever at that one is "abstraction is invaluable." Just remember that you loose details with abstractions, which means some versions of some gates might cost more than another due to inefficiency.
So, here come the dreaded truth tables.
AND Truth Table
| 0 | 1 |
| 0 | 0 | 0 |
| 1 | 0 | 1 |
OR Truth Table
| 0 | 1 |
| 0 | 0 | 1 |
| 1 | 1 | 1 |
eXclusive OR Truth Table
| 0 | 1 |
| 0 | 0 | 1 |
| 1 | 1 | 0 |
So what do all the 1s and 0s mean? Well, I guess you might live under a rock. The 1s represent "true" and the 0s represent "false." "AND" is only true if both statements surrounding "and" are true. For example, you'd only take an umbrella if it's raining and you like being dry. If you clean your room or you clean the garage, you may get ice cream (if you do both, you still get ice cream). XOR is "exclusive or," which makes it the same as OR, except that if both statements are true, the end result is false. For example, this vendor does not have twist, so you can have vanilla xor you can have chocolate: You cannot have both, as twist is not available, but you can also choose to have neither as well, so you better pick between chocolate or vanilla if you want to eat ice cream.
Now, to demonstrate the NAND to ensure you get the "not" operations, if you took a bath nand you brushed your teeth, you stink.
Get your own web kitty here!
©Copyright 2010-2023. All rights reserved.