FINAL EXAM Solution

2 hours, 30 minutes

Do any 5 of the first 6 plus any 5 of the second 6. Be sure it is clear which problems you do not want graded. All problems are equally weighted. 1. For the following function, f, find BOTH minimum sum of product expressions. (Two blank maps are given.) f(w, x, y, z) = m (0, 1, 2, 3, 5, 7, 8, 10, 11, 12, 13, 15) wx yz 00 01 11 10 00 01 11 10 1 1 1 1 1 1 1 1 1 1 1 1 wx yz 00 01 11 10 00 01 11 10 1 1 1 1 1 1 1 1 1 1 1 1

f = w x y' + x' z' + w' z + y z f = w y' z' + x z + w' x' + x' y 2. For the following function, find all four minimum sum of products expressions. (four copies of the map are shown.) ab cd 00 01 11 10 00 01 11 10 1 X 1 X X X 1 1 X X 1 1 X ab cd 00 01 11 10 00 01 11 10 1 X 1 X X X 1 1 X X 1 1 X

a b + b' c + b' d'

a b + b' c + a' b'

ab cd 00 01 11 10

00 01 11 10 1 X 1 X X X 1 1 X X 1 1 X

ab cd 00 01 11 10

00 01 11 10 1 X 1 X X X 1 1 X X 1 1 X

a b + a' b' + a c

a b + b' d' + c d

3. For the following function, g, find all minimum sum of product expressions and all minimum product of sums expressions. (There are a total of 4. Two copies of the map and two blank maps are given.) wx yz 00 01 11 10 1 00 01 11 10 1 1 1 1 1 1 1 1 yz 00 01 11 10 1 wx 00 01 11 10 1 1 1 1 1 1 1 1

g = y' z + x z + w' y z' + {w' x' y' or w' x' z'} g = y' z + x z + w' x' z' + w' x y wx yz 00 01 11 10 1 1 1 1 00 01 11 10 1 1 1

g' = x' y z + x y' z' + w z' g = (x + y' + z') (x' + y + z) (w' + z)

4. For the following 5-variable problem, F, find all three minimum sum of products expression. (Two copies of the map shown.) BC DE 00 01 11 10 1 0 00 01 11 10 X 1 1 X X 1 1 X A 1 BC 00 01 11 10 DE 00 01 11 10 X 1 1 X X X 1

F = A' B' D E + B' C E + B D E' + {C' D' E' or B C' E'} BC DE 00 01 11 10 1 0 00 01 11 10 X 1 1 X X 1 1 X A 1 BC 00 01 11 10 DE 00 01 11 10 X 1 1 X X X 1

F = A' B' D E + B' C E + B C' E' + B C D 5. For the following three functions of four variables, find a sum of product expression for each such that the total number of gates is minimized for an AND/OR solution. All inputs are available both uncomplemented and complemented. Full credit for solutions using 9 gates and 26 gate inputs. Show the maps and the algebraic expressions.

ab cd 00 01 11 10

00 01 11 10 1 1 1 1 1 f 1 1 1 1

ab cd 00 01 11 10

00 01 11 10 1 1 1 1 1 1 g 1 1 1

ab cd 00 01 11 10

00 01 11 10 1 1 1 1 1 1 1 h 1 1

f = a c' + a' c d + b' d' g = a c' + a' c d + b c d' + b' c' d' h = a b' + a c' + b c d' + b' c' d'

6. The following is the only minimum sum of product expressions for a function, G. G = A' C' E' + B' C E + B' D' E' + C D' E + B C' D + A' B C' All inputs are available both uncomplemented and complemented. Show the equation and a block diagram for an implementation that uses only 2-input NAND gate. No gate may be used as a NOT. Full credit for a solution using no more than 12 two-input gates. Partial credit for solutions using one three-input gate. G = E' (A' C' + B' D') + C E (B' + D') + B C' (A' + D) = E' (A' C' + B' D') + [C + B (A' + D)] [C' + E (B' + D')]

7. For the following circuit

D = x A'

S = x' A' B'

R = x' A' B

z = A6B

a) a) Show the state table (labelling the states 00, 01, 10 11), ignoring the CLR' signal line. q1 q2 0 0 1 1 0 1 0 1 q1* q2* x=0 x=1 01 10 00 11 00 00 01 01 z 0 1 1 0

b) Complete the timing diagram below.

8. For the following circuit, complete the timing trace below. (Note that initially, all 4 flip flops have 0 in them.) Go as far as you can, even after you no longer know the input. However, once you cannot determine a value for any flip flop, you do not need to give additional values for that flip flop (even if you can determine them).

J = D' x A B C D 0 0 0 0 0 0 1 1 0 0 1 1 0 1 0

K=x 1 0 0 1 1 0 0 1 1 1

B* = A'

T=B

D* = C

0 1 0 1

0 1 1 0

1 1 0 1 0 1 0 1 1 1

9. For the following state table and state assignment, show a block diagram, the input equations (D, J, K), and the output equation, z, of an implementation that uses one D flip flop and one JK flip flop plus AND, OR and NOT gates. Choose which flip flop is used for each state variable so as to minimize the logic. Make it clear which type of flip flop is used for q1 and q2. q A B C D x=0 D B B D q * x=1 C A A A q1 0 q2 0 z 1 0 1 1 q1 * 0 q2* 1 q A B C D q2 0 1 0 1

q1 0 1 1 0

x 0

D C B A D C B

0 0 0 1 1 1 1

0 1 1 0 0 1 1

1 0 1 0 1 0 1

0 1 1 1 0 0 0

1 1 1 0 0 0 0

D1 = x' q1 + x q1' q2' D2 = x' z = q1' + q2' Use JK for q1 and D for q2.

J1 = x q2' J2 = x'

K1 = x K2 = x

10. Design a counter with three flip flops, q1, q2, and q3, that goes through the sequence 1 3 5 7 0 2 and repeat where, for example, 3 is represented by q1 = 0, q2 = 1, and q3 = 1. Use D flip flops. a) Show the equations for the three flip flop inputs. b) Show a state diagram, including what happens if the system, when first turned on, is in state 4 or state 6. q1 0 0 0 0 1 1 1 1 q2 0 0 1 1 0 0 1 1 q3 0 1 0 1 0 1 0 1 q1 * 0 0 0 1 X 1 X 0 q2* 1 1 0 0 X 1 X 0 q3* 0 1 1 1 X 1 X 0

q1* D1 = q1' q2 q3 + q1 q2' D2 = q2' D3 = q1' q2 + q2' q3 100 --> 110 110 --> 000

q2*

q3*

11. Show the state table or the state diagram for a Mealy system with one input, x, and one output, z, such that z = 1 iff at least 1 of the last 4 inputs have been 1. (Full credit for 4 states.) Example x z 100100000010011101000001 11111110001111111111100111

This is really the same as an output of 0 iff there have been at least four consecutive 0 inputs.

12. Consider the following state table: q A B C D E x=0 B A A E E q * x=1 D D E B C z 1 0 0 1 1

Three of the non-trivial SP partitions are P1 = (A B) (C) (D) (E) P2 = (A B C) (D E) P3 = (A) (B C ) (D E) a) Reduce the system to an equivalent one with the fewest number of states. Show the reduced state table. Use P3. q A B D q * z 1 0 1

x=0 B A D

x=1 C C C

b) Find the other non-trivial SP partition. P4 = (A B E) (C D) c) Replace the output column by one that prevents us from reducing the table (that is, one for which none of the SP partitions are output consistent). 1 0 1 1 1