This preview shows page 1. Sign up to view the full content.
Unformatted text preview: GEORGIA INSTITUTE OF TECHNOLOGY School of Electrical and Computer Engineering EE 2030 Final Exam Wednesday, December 15, 1999 Name: Last, First Closed book, three pages of handwritten notes allowed. None of the problems require involved calculations. Reconsider your approach before doing something tedious. Clearly identify each answer. Part 1 2 3 4 5 6 7 8 9 Total pts Score 25 20 20 30 20 20 25 20 20 200 Oops, the first one should be 5.625 Problem 2 (20 pts): a. Using proper mixedlogic notation, draw the gate implementation of the following expression. Use only NOR gates. Do not simplify the function. F = C ( A B + CD ) + B( AC + D E )
A B C D C B A C E D b. Write down the boolean expression for F directly indicated by this mixed logic circuit (i.e. do not simplify). A B D A C D B F F = ( A (B + D )) ( A C + BD) Looking back at the old exams, I think I told the students that they could assume the complemented signals were available for part (a) but not part (b). FYI, the numbers to the left show how many points I assigned while grading this problem ...
View
Full
Document
This note was uploaded on 06/17/2008 for the course ECE 2030 taught by Professor Wolf during the Fall '07 term at Georgia Institute of Technology.
 Fall '07
 WOLF

Click to edit the document details