TEST3-sol

TEST3-sol - 1 Fall 2010 Name:_SOLUTIONS + Grading...

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

View Full Document Right Arrow Icon
1 Fall 2010 Name: __SOLUTIONS + Grading instructions I.D.: _______________________________ INTRODUCTION TO DIGITAL SYSTEMS DESIGN TEST #3 April 22, 2010 Problem 1 _______________ (15 pts.) Problem 2 _______________ (20 pts.) Problem 3 _______________ (15 pts.) Problem 4 _______________ (20 pts.) Problem 5 _______________ (20 pts.) Total _______________ (90 pts.) Extra credit _______________ (10 pts.) * Remember to put your name and I.D.# on this exam. ** Show all your work (except for multiple choice problems). * Check that you have completed all parts of all problems. Do not spend all your time on one problem, since time is limited. ** Write solutions only on the front side of the exam sheets and only on the page associated with the problem. Solutions given in other locations will not be graded. *** Read and solve each problem carefully , since partial credit will be limited !
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Problem 1 A sequential circuit has one input, X, one output, Z, and two flip-flops, Q1 and Q2. A timing diagram for the circuit is shown below (assuming zero delays in the FFs and the gates.). Clock X Q1 Q2 Z (a) Is this a Mealy or Moore-type sequential system? (briefly explain) - Mealy, because the output depends on input X. (State changes on the negative edge of the clock pulse) (b) For present state Q2 Q1 = 11 and input X=0, what will be the next state ? - next state Q2 Q1 = 01 (c) For present state Q2 Q1 = 00 and input X=0, what is the value of output Z ? - output Z = 1 Grading: (a) (c) 5 points each
Background image of page 2
3 Problem 2 Consider a counter that has two control inputs, Z and Y, and operates as follows. When input Y=0, the state does not change, regardless of Z. When Y=1, the counter implements the counting sequences, as specified below: Z Y Counting Sequence 0 1 S0, S1, S2, S3, S4, and repeat 1 1 S0, S2, S4, and repeat (a) Show the transition diagram for this counter, using alphanumeric notation for state transition labels (i.e., values ZY = 10 are labeled as ZY’) (b) Implement this counter using D flip-flops and one hot state assignment
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/04/2010 for the course EE 2301 taught by Professor Larrykinney during the Spring '09 term at Minnesota.

Page1 / 8

TEST3-sol - 1 Fall 2010 Name:_SOLUTIONS + Grading...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online