midterm-example

midterm-example - NAND NAND NAND NAND NAND NAND Q A B 5....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Name: Midterm Practice EECS 203 April 24, 2009 1. (10 pts.) Find a minimal PoS form expression for the following function using a Karnaugh Map. f ( a , b , c , d ) = ( 0 , 2 , 3 , 4 , 12 , 14 ) + d ( 7 , 8 ) 2. (10 pts.) Minimize the following function using algebraic transformations or the Quine-McCluskey method. f ( a , b , c ) = a b + b c + a b c + a b c 3. (10 pts.) Show a minimal literal count expression for the following Boolean function. You may use either K-Maps or Boolean algebra to simplify the expression. Show your work. f ( a , b , c , d ) = ( 0 , 1 , 2 , 5 , 8 ) + d ( 11 , 10 , 12 , 15 ) 4. (10 pts.) What is the functionality of the following circuit? Justify your answer.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: NAND NAND NAND NAND NAND NAND Q A B 5. (10 pts.) You are monitoring a line transmitting 0-1 sequence and want to report a suspicious string 100011. You need to design a computer (that is, a state machine) that keeps reading the line and will raise a ag (output 1) each time such a string happens on the line. Show your work of design. You can write down the design as the state and output functions without drawing the gates. 1...
View Full Document

Ask a homework question - tutors are online