Solution-ElectricalandComputerEngineering-University.docVIP

The University of British Columbia Electrical and Computer Engineering Department EECE-256 Fall 2000 (Dr. Saif Zahir) Solutions to Assignment No. 2 (Issued October 3, 2000) Problem 1. Draw a K-map for the following Boolean expressions: X’Y’Z’ + XY’Z’ + X’YZ’ OR X’YZ’ + X’Y’ OR X’Y’ + Y’Z’ OR Problem 2. Using K-map, simplify the following Boolean algebraic expressions using Sum-of-Products: A’B’C’ + AB’C’ + ABC + A’BC’ + A’B’C (Terms 3, 4, and 5 are Don’t Care) OR BC BC The “don’t cares” did not help to provide simpler expressions. ABC + AB’C’ + ABC’ + AB’C (Terms 3 and 4 are Don’t Care) OR A A The “don’t cares” were all very useful in this exercise. ABCD + A’B’C’D + A’BCD + AB’CD + A’B’CD + ABCD’ (Terms 4,5, and 6 are Don’t Care) OR ABD + CD ABD + CD Two of the “don’t cares” were useful in this exercise. Problem 3. Using K-map, determine the minimal Product-of-Sums expression for the following minterms: m1 + m3 + m5 + m7 + m12 + m13 + m8 + m9 Truth table for this expression: A B C D F 0 0 0 0 m1 0 0 0 1 1 0 0 1 0 m3 0 0 1 1 1 0 1 0 0 m5 0 1 0 1 1 0 1 1 0 m7 0 1 1 1 1 m8 1 0 0 0 1 m9 1 0 0 1 1 1 0 1 0 1 0 1 1 m12 1 1 0 0 1 m13 1 1 0 1 1 1 1 1 0 1 1 1 1 OR F = (A + C + D)(A + C)(C + D) F = (A + C + D)(A + C)(C + D) The 0’s in the K-map are used to obtain the Product-of-Sum expressions. m0 + m5 + m7 + m8 + m11 + m13 + m15 Truth table for this expression: A B C D F m0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 m5 0 1 0 1 1 0 1 1 0 m7 0 1 1 1 1 m8 1 0 0 0 1 1 0 0 1 1 0 1 0 m11 1 0 1 1 1 1 1 0 0 m13 1 1 0 1 1 1 1 1 0 m15 1 1 1 1 1 OR F = (B + C + D)(B + C + D)(A + B + D)(C + D) The 0’s in the K-map are used to obtain the Product-of-Sum expressions. Problem 4. (logic design) Consider a five-input Boolean function that is asserted whenever exactly two of its inputs are asserted : construct the Truth Table for the function A B C D E F 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0