Here are some problems off an old test to be used to help in preparation for the next test. This is not necessarily a complete list. This is meant as a supplement, and is not a replacement for studying!! There is no guarantee that the test will contain only problems like these, or that problems like each of these will be on the test!

a.) wy' b.) y'c.) w'yz'd.)x'y'
e.) w'z' f.)y'z'g.)w'x'y'h.)wx'y'z'
4.) Which of the following expressions are TRUE for the 4 variable K-map shown above?:?
a.) F=w'z'+x'z'+x'y'+wy'c..) F'=(w'+z')(x'+z')(x'+y')(w+y')
b.) F'=yz+w'xz+wxyd.)F=(y+z')(w+x'+z')(w'+x'+y')

a.) F=(a'+b)(cd+e)+f'c.)F=(a+b')(c'd'+e')+f
b) F=(a'+b)(c'd'+e)+f'd.) F=(((a'b)'((c'd')'e)')'f')'
6.) Re-draw the circuit above using all NOR gates. (Hint: start by taking an answer from part 6 and
drawing it as with Ands, ors, and Inverters, then convert it...)

a.)Minimal Product-of-Sums form
b.) And-Or-Invert form
10 .) Given the following boolean functions:
F(a,b,c)=a'b'c+a'bc+ab'c G(a,b,c)=a'b'c'+a'b'c+ab'c'
a.) Show how you would implement these functions using the decoder shown below (you may add external gates if you deem it appropriate).

those fuses which you would LEAVE CLOSED!):

| x | y | z | F | G |
| 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 |
K-maps:

F:
G:
12.) a.)Implement your equation for ``F'' in problem 11 using a Multiplexer
b.)Implement your equations for ``F'' and ``G'' from problem 11 using
the PAL diagram below: