This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Problem 3 (20 Points): Give a truth table that shows all the stable operating states for this circuit. S Q Q R Consider the following sequence for S and R. SR = 01, SR = 00, SR = 11, SR = 10, SR = 00 Fill in the corresponding output for Q into the table. SR 01 00 11 10 00 Q Problem 4 (20 Points): Complete the timing diagram for the following circuit. Assume that all initial stored bits are zero. WE IN OUT φ 2 φ 1 IN φ 2 OUT φ 1 L L 2to1 MUX WE Problem 5 (22 Points): A state machine has the following truth table where A is the input. A S 2 S 1 S NS 2 NS 1 NS 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 1 0 1 0 0 0 0 1 0 1 1 1 1 1 1 1 0 0 1 0 1 1 1 0 1 1 0 0 1 1 1 0 0 0 1 1 1 1 1 0 1 1 0 X X X 0 1 0 a) Draw the state transition diagram. b) Use a decoder to design the combinational logic. c) Show the schematic of the entire state machine including the decoder....
View
Full Document
 Spring '07
 WOLF
 A Closed Book

Click to edit the document details