homework3

# homework3 - each flip-flop Show the state table and draw...

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

CS M51A / EE M16 Winter 2011 Homework #3 Problem 1) Determine the state diagram and state table for the sequential system which outputs a 1 when the input sequence does NOT contain the sequence 1-0. Problem 2) Determine the state diagram and state table for the sequential system described below: Input set: {a, b, c} Output: 1, if x(t – n, t) = aac*bb 0, otherwise (Note: c* means that c can appear 0 to unlimited number of times) Problem 3) Obtain a high-level description (state transition table) of the network shown in the fgure below. q B q B Problem 4) Using JK flip-flops and NOR gates design a D flip-flop. Problem 5) A sequential circuit has two JK flip-flops A and B and two inputs X and Y. The circuit is described by the following diagram. Derive input and output equations for

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.

Unformatted text preview: each flip-flop. Show the state table, and draw the state diagram. Problem 6) Minimize the following state table, Problem 7) Obtain the high-level state table for the following diagram. Implement the system using T flip-flops and multiplexers. S S 1 S 3 S 2 0, 00 1, 00 0, 01 1, 01 0, 10 1, 10 0, 11 1, 11 Problem 8) Using only GH flip-flops (state transition shown below) and multiplexers, implement the system given by the high-level table. PS, Q(t) GH 00 01 10 11 0 1 1 0 - 1 - 1 0 0 NS, Q(t + 1) PS, Q(t) X = 0 X = 1 A F, 0 E, 0 B G, 0 B, 1 C B, 0 H, 0 D F, 0 H, 0 E G, 0 C, 0 F G, 0 F, 1 G E, 0 A, 1 H G, 0 A, 0 NS Q(t + 1), Z...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

homework3 - each flip-flop Show the state table and draw...

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

View Full Document
Ask a homework question - tutors are online