Version A CSE/EEE120 Spring 2013 Individual Quiz Name: KE ASU ID: You have 20 minutes to complete and turn in this quiz. Each question is worth 20 points. Please read questions carefully. SHOW ALL YOUR WORK. Good luck! 1. Given the following truth table, HH cof Hocds eo-e eos Hono oHcle Dauaenoo (a) Write the SOP (sum of products) canonical expression for f f= abet Rhivaberabc (b) Write the product of sums expression for f in short hand notation. fe T1M00,4¢,6,}) 2. Using the truth table from problem 1 above, (a) Fill in the Karmaugh Map (K-Map) properly: (b) Group the appropriate terms in the K-Map above, and write the minimum SOP (sum of products) expression for f. fe Rbt beVersion A 3. Using the properties of Boolean algebra we have discussed in class, simplify the expression from part 1(a) above. fo aber abishbe tabe =htet abe t Rbe thbe Comma teDive) - ~ > . rbateve ) z(atorbe +t ablete) (desteed =| be 4 abe) Complemest ) = fet ( identity ) 4, Implement the function g = (a+b)(a'+e) using AND/OR/NOT logic gates. Make sure to label all lines correctly. Assume that only uncomplemented variables are available. wired as NOT gates. (ral 5, Implement the function g = (a+b)(a'+e) using only NOR gates. You may use NOR gates & oSVersion B CSE/EEE120 Spring 2013 Individual Quiz Name: k ey __ASU ID:. ‘You have 20 minutes to complete and turm in this quiz. Each question is worth 20 points, Please read questions carefully. SHOW ALL YOUR WORK. Good luck! 1. Given the following truth table, ne cone ces Honor oHole =a erosco- | were ocoos We uso) (a) Write the SOP (sum of products) canonical expression for f. f+ RPE + abies Bh + abe (b) Write the product of sums expression for f in short hand notation. f TM (UALS) 2. Using the truth table from problem | above, (a) Fill in the Karnaugh Map (K-Map) properly: c oo o |WH 2 1 Ie (b) Group the appropriate terms in the K-Map above, and write the minimum SOP (sum of products) expression for f feobt beVersion B 3. Using the properties of Boolean algebra we have discussed in class, simplify the expression from part 1(a) above. foabe tabi rabc rade s(Rtaybe + abcete) Cdistretol ive) > [.bC + ab-f (complement y > be tab Lidkentity ) 4, Implement the function g = ab + a'e using AND/OR/NOT logic gates. Make sure to label all lines correctly. Assume that only uncomplemented variables are available. ry j 5. Implement the function g = ab + ae using only NAND gates. You may use NAND gates, wired as NOT gates.