State Diagrams - Mallard ECE 290: Computer Engineering I -...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded Web... file:///C:/Documents%20and%20Settings/Al/Desktop/Mallard_HW_8/St... 1 of 2 3/13/2007 1:08 AM Graded WebQuiz: State Diagrams You have submitted this WebQuiz 2 times (including this time). You may submit this WebQuiz a total of 10 times and receive full credit. Question #1 Consider the state diagram shown below. The input variable is x and the output variables are z1z2. Assuming the initial state is a , give the output sequence corresponding to the input sequence x = 1,0,1,0,1,0. Enter the outputs in order of occurrence, separated by commas or spaces. (E.g. 00, 01, 11) z1z2 = 00 00 01 01 10 10 You received a raw score of 100% on this question. Question #2 Consider the state transition diagram given below with four states a, b, c, d. Complete the next-state table corresponding to the following Y1Y2 state assignment: a=01, b=10, c=11, d=00....
View Full Document

This note was uploaded on 06/21/2011 for the course ECE 290 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 2

State Diagrams - Mallard ECE 290: Computer Engineering I -...

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

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