{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# 4-M2 - Midterm 2 ECE 25 Spring 2008 Tuesday Name PID...

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

Midterm 2 ECE 25, Spring 2008 Tuesday, May 20, 2008 Name: PID: Problem Points Score 1 10 2 10 3 10 4 10 5 10 Total 50 Consider the following incompletely-speciﬁed Moore machine (“*” indicates don’t cares). S 1 + S 0 + S 1 S 0 I =0 I =1 F A A C 1 B C A 0 C B * 0 Suppose we use the following state encoding. State S 1 S 0 A 01 B 11 C 00 Derive the minimum two-level logic for each of the following (you should minimize each logic function separately, no need to worry about sharing logic between logic functions). F = S 1 + = S 0 + = 1

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

View Full Document
I F D-FF XOR XOR XOR S 1 S 1 + D-FF S 0 S 0 + a) Fill out the following functions (OK to use in functions). F = S 1 += S 0 b) Assume initial state is 11 , ﬁll in the following state table. If a state is not reacheable, indicate the appropriate don’t cares (use “*” to indicate don’t cares). S 1 + S 0 + S 1 S 0 I =0 I =1 F 00 01 10 11 c) With initial state = 11 , what states, if any, are not reacheable? 2
Consider the following sequential logic diagram.

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.

{[ snackBarMessage ]}

### Page1 / 5

4-M2 - Midterm 2 ECE 25 Spring 2008 Tuesday Name PID...

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

View Full Document
Ask a homework question - tutors are online