CPSC 330 - Spring 2011
Homework 2
Due Monday, February 21
Each student must turn in a separate set of homework solutions, but
you may work together in study groups with other students from the
class. Include their names in parentheses under your name on the
solution set you submit.
Appendix C - end of appendix questions
1. C.2 - please identify which Boolean algebraic law or postulate is
the basis for each step in your proof. See the list of laws on
page C-6 or in the course notes. However, note the error in the
second inverse law on page C-6; it should be A*(~A) = 0.
2. C.6
3. (a) C.7
(b) Draw a K-map for the truth table you obtain, and use it to
determine a simplified logic expression for 4-bit odd-parity.
4. For the truth table at the top of page C-18, draw a K-map for each
output, D, E, and F, and determine the simplified logic expression
for each output.
5. C.10 - Assume that you must produce A NAND B as the output using
only two-input muxes. You may use up to three two-input muxes in
your implementation. You may also use 0 and 1 as inputs and/or
select signals in your implementation in addition to the A and B
signals. However, you must not use any other gates or signals;
specifically, you are not to use a stand-alone NOT gate, and you
are not to use ~A or ~B as externally-available input or select
signals. If you decide that you want the function of a NOT gate,
you must use a two-input mux to implement it.
6. C.11
7. We did a straightforward design of the "electronic eye" problem
of C.37 in class using a modulo 2-bit counter.
(a) Draw the state diagram with /