Test2soln-2730-S11

# Test2soln-2730-S11 - EE 2730 Test 2 solutions 1 EE 2730...

This preview shows pages 1–2. Sign up to view the full content.

EE 2730 — Test 2 solutions 1 EE 2730 — Test 2 solutions Spring 2011 1. (35 pts) Design a circuit to control a simple vending machine. It has two inputs, d and n , that indicate whether a dime ( d = 1) or a nickel ( n = 1) has been inserted; it has one output r , where r is 1 to release the product. The machine releases the product when 15 cents have been inserted. Assume that only one coin is inserted at a time. The machine does not give change (even if two dimes have been inserted). After asserting r = 1, the circuit should go to the next state depending on the input just as it does from the reset state (that is, it keeps no history of coins inserted before r = 1). Show the state diagram or state table, as well as the state assignment, state assigned table, and minimal Boolean expressions for the flip-flop inputs. (You do not need to draw the circuit.) State diagram: state A denotes that no money has been deposited, state B (C, D) that 5 (10, 15) cents have been deposited. The labels on state transitions are the inputs

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/20/2011 for the course EE 2730 taught by Professor Desouza during the Spring '08 term at LSU.

### Page1 / 4

Test2soln-2730-S11 - EE 2730 Test 2 solutions 1 EE 2730...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online