1&2 /20
3 /20
4 /15
5 /20
6 /25
Name___________________
SID_____________________
EECS150
Midterm1
2/16/06 Total /100
1) Given F=AB+CD’
a. Implement F using as few 2 input NAND gates as possible. Assume that
only the true literals (A,B,C,D) are available, not their complements (A’,
B’, C’, D’).
b. Write F’ in product of sums notation
2) Given G = (A+B)(C’+D)
a. Implement G using as few 2 input NOR gates as possible. Assume that
only the true literals are available, not their complements.
b. Write G’ in sum of products notation.
