**Tom Kelliher, CS 240**

**Jan. 27, 2012**

Read 2.3-4.

Introduction

- Binary logic and gates.
- Boolean Algebra.

Standard forms, maps, and minimization.

- Fundamental operators and their symbols:
- AND
- OR
- NOT

- AND
- NAND is
*complete*. - Gate fan-in and fan-out. Electrical significance.
- Timing diagram.
- Frequency and period.
- Timing diagrams. Show AND, OR, NOT waveforms for input: A: 0011,
B: 0101.
- What do the waveforms really look like: propagation delay, noise,
under- and over-shoot.

- Frequency and period.

- Boolean functions can be represented by equations, truth tables, or
logic circuits.
How do you convert from one form to another?

How many rows in the truth table of an -input Boolean function?

- Why would we want to simplify a Boolean equation?
- Basic Identities:
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17.

Example simplifications. Use both a truth table and Boolean manipulation to show:

Thomas P. Kelliher 2012-01-25 Tom Kelliher