What you should know coming into ESE370
ESE370 builds on a basic understanding Boolean logic from ESE170.
The course will largely assume you are expert at the following:
If you are rusty about any of this (or it seems unfamiliar),
you should definitely take time to review it immediately before you
fall behind. If you don't know where to start, do not hesitate to discuss with a TA.
- DeMorgan's Law
- Completing a truth table for a Boolean logical expression (and,
or, not, xor, nor nand)
- Turning a Boolean logical expression into a gate-level
- Identifying the logical expression implemented by a gate-level
- Optimizing a gate-level implementation (including Karnaugh Maps)
- nand gate universality
ESE370 Home Page