CS/ECE 252 Introduction to Computer Engineering Spring 2007 Sections 1 and 2 Instructor Mark D. Hill and TAs Marc de Kruijf & Sanghamitra Roy URL: http://www.cs.wisc.edu/~markhill/cs252/Spring2007/

Homework 3 // Due at Lecture Wed Feb 28

Note that the notation C' stands for not C in the boolean expressions.

You may do this homework in a group of two students from the same 252 section and turn in one solution at lecture with BOTH students names at the top.

First contact for questions is TA Sanghamitra Roy at: roy1@wisc.edu

1. Draw a logic circuit corresponding to the following Boolean expression. Your circuit must use only 2-input AND, 2-input OR, and NOT gates. Z = A'B' + BC + A(B' + C').
2. Draw the truth table for a logic circuit that performs the following function. It has four inputs A, B, C and D. The output Z is 1 if and only if the total number of 1s among A, B, C, and D is even. Also write the Boolean expression corresponding to the circuit.
3. Problem 3.6 on page 84 of ItCS.
4. Problem 3.9 on page 85 of ItCS.
5. Problem 3.20 on page 88 of ItCS.
6. Problem 3.21 on page 88 of ItCS.
7. Problem 3.23 on page 88 of ItCS.
8. Derive a Boolean expression for a logic function represented by the following truth table. Simplify the answer as much as possible.