ECS154A Homework #3

Assignment (Written):

  1. Do Problem 7.6 in the book
  2. Do Problem 7.8 in the book
  3. Do Problem 8.2 in the book (use T instead of JK FF's)
  4. Do Problem 8.5 in the book, detecting 011 or 010 patterns
  5. Do Problem 8.6 in the book, detecting 011 or 010 patterns
  6. Do Problem 8.11 in the book, detecting 0110 or 1101 patterns
  7. Do Problem 8.12 in the book, with p=1 if the number of 1's is even

Assignment (MaxPlus):

  1. Do Problem 8.24 in the book, only make it a modulo-5 counter.
  2. Consider a coin-operated vending machine. Assume that the
    machine accepts only quarters, dimes, and nickels. Coins are inserted 
    until a total of 20 cents or more is deposited. Only 
    one coin is deposited at a time. The output signal z1=1 should indicate 
    that merchandise should be provided; z1=0 indicates no merchandise.
    
    Coincident with the last coin input, the (change) outputs are to be set.
    Assume the machine can give a dime (z2=1) and/or a nickel (z3=1).
    Use the binary outputs z2 and z3 to represent the 4 distinct possibilities
    (No change, 1 nickel, 1 dime, 1 nickel and 1 dime.)  If a customer does
    something unwise, like puts in a dime and a nickel followed by a quarter, 
    correct change does not have to be provided (but the maximum amount change 
    does.)
    
    Design the circuit in Maxplus.