All problems can be found in Tocci and Widmer

1). 5-16 on page 250

2). 5-18 on page 251

3). 5-21 on page 251

4). 5-22 on page 251

5). 5-23 on page 252

6). 5-24 on page 252

7). 5-25 on page 252

8). 5-27 on page 253

9). A 5-bit right-shift shift register is connected so that the input bit to the leftmost flip flop is the XOR of the current first and last bits in the register. The register is initially loaded with all 1's. Find the output sequence, up to the point where it repeats.

10). Consider the following "digital system": A man, a wolf, a goat, and a cabbage are on the left bank of a river. The man has a boat that will carry him and at most one other object across the river. He wants to get everything to the right bank. But he can't ever leave the goat alone with the wolf, or the cabbage alone with the goat, as one will eat the other.

How can he do this? Represent the state of the system by a 4-bit quantity, where each 1 represents "is on the left bank" and each 0 represents "is on the right bank". Taking the bits in the order: man, wolf, goat, cabbage, then, for example. 1101 mean the man, wolf and cabbage are on the left bank (a legal situation); 1001 mean the man and cabbage are on the left bank (illegal!! - why?)

Draw the state transition diagram showing a path from the initial state 1111 to the final state 0000, that flows through legal states only. Is there more than one solution?