EEE8 Third Exam 1 Semester 2009-10 September 14, 2009 7-9AM Instructions: Start each problem on a new page. Do not write anything at the back of your papers. Anything written at the back of your answer sheets will be considered scratch. Write your solutions completely, legibly and clearly. Indicate all assumptions. BOX all final dnewers, Whenever plots are required, include all important tick-marks and labels. Anyone ‘aught cheating will have a date with the Student Disciplinary Tribunal. NO CALCULATORS ALLOWED. USE ONLY BLACK/BLUE PENS. 1. Given: F(A,B,C,D) = A°B + ABC + B'CD + BD" (a) Without using Kemaps, find the standard SOP expression. Sort the literals in each term alphabetically.(5 pts) : (b) Write the truth table for the given expression. The rows of the truth table must be sorted by ascending minterm number. (5 pts) 2. Simplify the Boolean function F{A,B,CD) = Zm(0, 2, 5,6,8, 10, 13, 14) Using K-maps, (a) Find the rninimal SOP (7.5 pts) (b) Find the minimal POS (7.5 pts) ‘Show groupings and indicate the term in the final expression that corresponds to each group. Sort the literals in each term alphabetically. (Use separate K-maps for 2 and b) 3, Implement the function F= A’C + A’B + AB'C + BC (2) Usinga minimum number of 2-input (AND, OR) and NOT gates only. Indicate total number of gates used. (10 pts) (6) Using a minimum number of 2-input NAND gates only. Indicate total number of gates used. (Hint: DM's T) (15 pts) 4, You must transport two missionaries (M:, Mz) and two cannibals (Cs, Ca) from one side of the river (side A) to the other side (side B) using a boat. To prevent a tragedy, there must always be more missionaries than cannibals on one side of the river ata given time, Model this problem as a Boolean function. Let Mx, Mz, Ci, Gabe the inputs. A logic 0 input means they are on side A, while a logic 1 input means they are on side B. A logic 1 output indicates that the situation favors the cannibals (dinner time). (a) Create the truth table for the function, Sort the minterms in ascending order Order the inputs as MiMzC1Cz, (10 pts) (b) Draw the K-map for the function. (5 pts) (6) Find the minimal POS expression. Show the groupings. (S Pts) (4) Realize the function using a two-level POS logic circuit. (5 pts) 5. Given: F (A,B,C,D.E) =m (0, 2, 4,6,9, 11, 13, 15, 17, 21, 25, 27,29, 31). (G) Determine the prime implicants using Quine McClusky (decimal version). (20 pts) (b) Determine the essential prime implicants. (5 pts) (6) Determine the simplified SOP of the function F(A.B,C.D.E). (10 pts)