This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: (B + C) (C + A B) ECE 2030  Introduction to Computer Engineering EXAM #1 SOLUTION (version A) February 5, 2004 Page 2 of 2 Problem 3. (20 points) A. B. 00 01 11 10 CD AB 00 0 0 0 0 01 1 1 1 0 11 1 0 1 1 10 1 1 0 1 00 01 11 10 CD AB 00 0 0 0 0 01 1 1 1 0 11 1 0 1 1 10 1 1 1 00 01 11 10 CD AB 00 1 x 0 x 01 0 x 1 0 11 1 1 0 0 10 1 x 1 00 01 11 10 CD AB 00 1 x 0 x 01 0 x 1 0 11 1 1 0 0 10 1 x 1 Final SOP Final POS Final SOP Final POS A. F(A, B, C, D) = A D + A B C + A B C + B C D Number of essential prime implicants: 2 (first two in above expression) F(A, B, C, D) = (A + B) (B + C + D) (A + C + D) (A + B + C + D) Number of essential prime implicates: 4 B. F(A, B, C, D) = B D + A C + A B D F(A, B, C, D) = (B + D) (A + B + D) (A + B + C) Problem 4. (20 points) A. F = (A + C) (B + D E) + B C E # of gates: _1_ AND _1 _ OR _2 _ NAND _2 _ NOR _5 _ INVERTER B. G Z Y W X G = ( W X + X Y ) ( W + Y Z ) # of gates: __6 _ ANDs __5 _ INVERTERs...
View
Full Document
 Spring '07
 WOLF

Click to edit the document details