Chapter Six Solutions

1. a. x 1 0 1 1 0 0 0 1
q1 0 0 0 1 0 1 0 0 1 0 1 0
q2 0 0 1 1 1 0 0 1 1 1
z 1 0 0 0 0 1 0 0 ? 0

After the last input is known, state 11 always goes to 01 (independent of the input). Then 01
goes to either 10 or 11; thus q1 = 1. Finally, both 10 and 11 go to either 00 or 01, making
q1 = 0. The output depends upon the input in state 11, but is 0 for both values of x in state 01.
(Generally, we do not worry about values once one is not known; thus the last z may be
omitted.)

b. x 1 1 0 1 0 1 0 1 0 0 1 0 1 1
q A B B C D C D C D C A B C D B
z 0 0 0 0 1 0 1 0 1 0 0 0 0 1 0 0
After the last input, state B goes to either C or B, the output of which is 0 for both.

c. x 0 0 1 1 1 0 0 0 0 0 1 0
q A B C B A C A B C A B A B
z 0 0 0 0 1 1 0 0 1 0 0 0 0

d. x 0 1 0 0 0 1 1 1 1 0 1
q A A B C A A B D D D C B
z 1 0 0 0 1 0 0 0 0 1 0 0

2.

Using the latch of Solved Problem 1, A is R' and B is S'. When the gate is high, R and S pass
through. When Gate is low, A and B remain 1 (inactive).

PROPRIETARY MATERIAL. © 2008 The McGraw-Hill Companies, Inc. All rights reserved. No part of this Manual may be displayed, reproduced or
distributed in any form or by any means, without the prior written permission of the publisher, or used beyond the limited distribution to teachers and
educators permitted by McGraw-Hill for their individual course preparation. If you are a student using this Manual, you are using it without permission.
1
3.

2
4.

c)

3
5. IN = x Q' + x' Q

6.
Q* = A ⊕ B 11 11
00 11 00
00
0 1
01
10

7. a. DA = x B' DB = x ' A' z = x B + x' A' B'

Note that there are two false outputs (glitches) because x changes after the clock edge.

4
 b. D1 = x J2 = x + q1 K2 = q1' z = q1 q2'

Note that at the last clock edge, J2 is unknown, but K2 = 1. Since q2 was in state 1, it will go to
0 whether J2 is 0 or 1.

c. T1 = x S2 = q1 R2 = q1' q2 z = q2

d. S1 = q3 + x R1 = (q3 + x)' D2 = q1' J3 = K3 = q2

5
Even after x is no longer known, we can determine q1. Since q3 = 1, S1 = 1 and R1 = 0. At the
second edge, q3 = 0 and thus, S1 and R1 depend on x. Since D2 depends only on q1, we can
find q2one clock period after we know q1. Finally, since q3 depends only on q2, we can
determine it for one additional clock period.

8. a. D1 = x + q2' D2 = q1 z = q1 + q2'

q*1 q2*
q1 q2 x=0 x=1 z
00 10 10 1
01 00 10 0
10 11 11 1
11 01 11 1

x 0 0 1 1 0 0 1 1 0
q1 0 1 1 1 1 0 0 1 1 0 ? 1 ?
q2 0 0 1 1 1 1 0 0 1 1 0 ? 1
z 1 1 1 1 1 0 1 1 1 0 1 1 ?
Note that at the first clock when x is not known, the next state is 0 0 or 1 0; thus q2 is 0. The
output is 1 in either of those states. From those states, the only possible next state is 1 0 or
1 1; thus q2 goes to 1. Finally, from these two, the next state is either 0 1 or 1 1, making
q2 = 1. That is far as we can tell anything.

b. JA = x' B KA = x JB = x' KB = x A' z = x' A' + x B

A*B* z
AB x=0 x=1 x=0 x=1
00 01 00 0 0
01 11 00 0 1
10 11 00 1 0
11 11 01 1 1

x 0 0 1 1 0 0 1 1 0
A 0 0 1 0 0 0 1 0 0 0
B 0 1 1 1 0 1 1 1 0 1 1
z 1 1 1 1 1 1 1 1 1 1

6
 c. J1 = x' K1 = x J2 = q1' K2 = q1 z = x q1 q2
q1*q2* z
q1 q2 x=0 x=1 x=0 x=1
00 11 01 0 0
01 11 01 0 0
10 10 00 0 0
11 10 00 0 1

x 0 1 1 0 1 1 1 1 1
q1 0 1 0 0 1 0 0 0 0 0
q2 0 1 0 1 1 0 1 1 1 1
z 0 1 0 0 1 0 0 0 0 0

d. S1 = x R1 = x' q2 T2 = x' + q1' z = x (q1 + q2')

q1*q2* z
q1 q2 x=0 x=1 x=0 x=1
00 01 11 0 1
01 00 10 0 0
10 11 10 0 1
11 00 11 0 1

x 0 0 1 1 0 0 1 1 0
q1 0 0 0 1 1 0 0 1 1 1
q2 0 1 0 1 1 0 1 0 0 1
z 0 0 1 1 0 0 0 1 0

9. a. JA = x KA = C' TB = A SC = B' RC = B
z=B+C C* = B'

x 0 1 1 0 1 0 1
A 0 1 1 1 1 1 0 1 0
B 0 0 1 0 1 0 1 1 0 0
C 0 1 1 1 1 0 1 0 0 1 1
z 0 1 1 1 1 0 1 1 0 1 1

b. DA = x + C TB = A C* = B

x 0 1 0 1 0 1 0
A 0 0 1 0 1 1 1 0 1
B 0 0 0 1 1 0 1 0 0 1
C 0 0 0 0 1 1 0 1 0 0 1

7
c. TA = x C' B* = A' C* = x' z=BC

x 0 1 1 0 0 1 1 1 0
A 0 0 0 1 1 1 1 0 1 1 1
B 0 1 1 1 0 0 0 0 1 0 0 0
C 0 1 0 0 1 1 0 0 0 1
z 0 1 0 0 0 0 0 0 0 0 0 0

d. J1 = x K1 = x' q3' q2* = q1' D3 = x + q2

x 0 0 1 0 0 0
q1 0 0 0 1 1 1 0
q2 0 1 1 1 0 0 0 1
q3 0 0 1 1 1 0 0 1 1