Building a Mod n Counter - Mallard ECE 290: Computer...

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

View Full Document Right Arrow Icon
.. https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3. .. 1 of 3 3/24/2007 8:00 PM Graded WebQuiz: Building a Mod n Counter You have submitted this WebQuiz 1 time (including this time). You may submit this WebQuiz a total of 10 times and receive full credit. Question #1 Suppose a 12-bit binary ripple counter is in state 100101111111. How many flip-flops will be complemented (i.e. change state) to reach the next count? 8 You received a raw score of 100% on this question. Question #2 The circuit shown below, containing three negative-edge-triggered flip-flops, is a modification of an ordinary 3-bit synchronous counter. (The clock inputs have been omitted from the diagram.) a) For what state CBA does p = 1? CBA = 101 What will the next CBA value be? CBA = 000 b) In what CBA sequence does the circuit count? (List all states, starting after 000 and ending with 000.) CBA = 000, 001 010 011 100 101 000 You received a raw score of 100% on this question. Question #3
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the 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 / 3

Building a Mod n Counter - Mallard ECE 290: Computer...

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