In the following, WH3 refers to the Weste Harris textbook.

1. [5] WH3 Problem 6.16 (short)
2. [10] WH3 Problem 6.20
3. [10] WH3 Problem 6.28.  Assume both the true and complement are available for each of the three input signals, e.g., A, A', B, B', C and C'.  You must generate both the OR and the NOR outputs, using a pair of domino gates.  What is the logical effort of the combination?
4. [5] WH3 Problem 7.2 (short)
5. [5] WH3 Problem 7.4 (short)
6. [5] WH3 Problem 7.6 (short)
7. [10] WH3 Problem 7.10
8. [5] WH3 Problem 7.18 (short)
9. [10] Consider the following Boolean expression:  A'C' + BC + A'B.  Show how a straightforward sum-of-products implementation has at least one stuck-at fault that is not testable.  Can you modify the sum-of-products implementation to make that fault testable?
10. [10] WH3 Problem 10.2 (short)
11. [10] WH3 Problem 10.22.  Hint:  Write recursive Boolean equations, i.e., express answer at bit position i in terms of neighboring positions.
12. [10] Problem 11.10 (short)
13. [5] Problem 11.12 (short)

The assignment is in lieu of a final exam, and is due under my door no later than Tuesday, May 10, 2005.