Homework #5 is now due on 8 March.
Do the following problems from Chapter 4 (pp. 119-122)
This problem is to design a Nabs dispenser. Your machine has two inputs, x and y, which encode the following information:
x y Meaning
0 0 nothing is happening
0 1 nickel inserted
0 1 dime inserted
1 1 Nabs button pushed
There is a single output, z. When z is 0, the machine produces nothing. When z is 1, the machine outputs a packages of Nabs.
Assume that Nabs cost 15 cents. Nabs are returned only if the Nabs button is pushed after 15 cents are deposited. Assume that this %!@%$# machine returns no change and just keeps any money you deposit over 15 cents.
Show how to implement that machine in a sequential circuit. Enter your circuit into diglog to test it.
At the end of class on Tuesday, 8 March, there will be a brief (30 minute) quiz on Chapters 2 and 3 of the textbook.