This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Mallard ECE 290: Computer Engineering I - Spring 2007 - Graded Web... https://mallard.cites.uiuc.edu/ECE290/webgrade.cgi?SessionID=mding3... 1 of 2 2/10/2007 11:02 PM Graded WebQuiz: K-Map Minimization II You have submitted this WebQuiz 2 times (including this time). You may submit this WebQuiz a total of 10 times and receive full credit. Warning: Use the correct variables . Question Weights: 40%, 40%, 20% Unlike most quizzes, you will probably need to work these problems on scratch paper. If this or either of the other two K-map quizzes takes you more than about 10 minutes to solve, you probably need more practice and/or pointers. Please stop by office hours for suggestions! Question #1 Give minimal SOP and POS expressions corresponding to the following Karnaugh map: yz 00 01 11 10 wx 00 x x 1 x 1 1 1 1 01 11 10 z'y'x+yz+ywx Enter a minimal SOP Boolean expression (x+z)(z'+y)(y'+w) Enter a minimal POS Boolean expression You received a raw score of 100% on this question....
View Full Document
- Spring '08