ELEC 101, Spring 1998
Prof. Rich Kozick
Date Assigned: Friday, April 10, 1998
Date Due: Wednesday, April 15, 1998
- Exam 3 will be on Friday, April 17.
Please continue reading
Chapter 11, Sections 11.1 - 11.5.
Please do the following problems in Chapter 11:
28, 31, 34, 35, and 41.
Draw a logic diagram that implements a 3-input AND gate using only
2-input AND gates.
Do the same for OR: implement a 3-input OR using 2-input ORs.
- Prove DeMorgan's Theorems by writing the truth table for both
sides of the identity, and showing they are the same.
Draw logic diagrams for NOT, AND, and OR gates using only 2-input
NAND gates. (Hint: Use DeMorgan's Theorem.)
Use DeMorgan's Theorems to show the equivalence of the following
logic gates: (the circles indicate NOT operation)
- Use the previous problem to convert the following AND-OR logic
diagram to an implementation that uses only NAND gates.
Verify your NAND implementation by showing that it has the same
truth table as the given circuit.