10 points. Assigned: Oct 1, 2003. Due: Oct 6, 2003
1. For the Boolean function:
f = (A' + B)(B' + C)
a) Express the function as a truth table
b) Implement an AND-OR logic circuit from the truth table
c) Implement a logic circuit directly from the original equation
d) Implement the function using a 8-to-1 mux
2. For the truth table with 3 inputs (x, y, z) and 2 outputs (s, c) below:
| x | y | z | s | c |
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
a) Express as 2 Boolean functions
b) Implement an AND-OR logic circuit
c) Implement this using only NAND gates
d) What does this circuit do?
3. Complete Problem 3-12 on page 200.
a) Express as a truth table with 2 inputs (A, B) and 2 outputs (C, D)
b) Express the circuit as 2 Boolean equations
c) What does this circuit do?
d) Draw an equivalent circuit that uses 1 XOR gate and 1 AND gate
4. Draw the "black box" interface (inputs and outputs) of each of the "generic" circuits below:
a) An n-to-1 mux
b) An n-to-2^n decoder
c) An n-bit comparator
5. Complete Problem 3-11 on page 199. You can use the PLA format given in the book or the one on my handout with the AND plane and OR plane.
6. Complete Problem 3-22 on page 201.