{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Computer Science 150 - Fall 1995 - Koren - Midterm 2

Computer Science 150 - Fall 1995 - Koren - Midterm 2 -...

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

View Full Document Right Arrow Icon
CS150, Quiz 2, Fall 1995 CS150, Fall 1995 Quiz #2 Professor I. Koren Problem #1 A Twisted Tail Ring counter is shown below. Show the state diagram, accounting for all possible states? Is this counter self-starting (self-correcting)? Explain. Problem #2 A 4 --> 1 MUX (Multiplexer) shown below can be used to realize any 3-variable switching function with no added logic gates. In this problem we will try to find out whether a given 4-variable switching function f(W, X, Y, Z) can be realized using a single 4 --> 1 MUX with no added gates. file:///C|/Documents%20and%20Settings/Jason%20Raft...0-%20Fall%201995%20-%20Koren%20-%20Midterm%202.htm (1 of 4)1/27/2007 5:38:29 PM
Background image of page 1

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

View Full Document Right Arrow Icon
CS150, Quiz 2, Fall 1995 Problem #2a Given the function f(W, X, Y, Z) = (Sigma)m(2, 3, 4, 6, 7, 15) + (Sigma)d(0, 5, 12, 13) and its K-map, is it possible to realize it using a single 4 --> 1 MUX by choosing S 1 S 0 = W X, D i (a member of) {0, 1, Y, not Y, Z, not Z} ; i = 0, 1, 2, 3 (the complements of the input variables are available). If your answer is positive show the realiziation; if it's negative explain why.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}