Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A computer engineering exam from spring 2010 (ece 2030 a) consisting of 4 problems and 5 pages. The exam covers various topics such as incomplete circuits, boolean algebra, karnaugh maps, and mixed logic design. Students are required to complete the exam in pencil, without calculators or notes, and must show their work for maximum credit. The exam includes problems on completing circuits, transforming boolean expressions, deriving simplified expressions using karnaugh maps, and implementing boolean expressions using different gate types.
Typology: Exams
1 / 5
This page cannot be seen from the preview
Don't miss anything!
ECE 2030 A 10:00am 4 problems, 5 pages Computer EngineeringExam One 10 February 2010Spring 2010 Instructions: a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate the pages of the exam. For maximum credit, show your work. Good Luck! This is a closed book, closed note exam. Calculators are not permitted. If you have Your Name ( please print ) ________________________________________________
301 202 243 264 total 100
ProblemECE 2030 A 10:00am^ 4 problems, 5 pages 1 (3 parts, 30 points)^ Computer EngineeringExam One^ Incomplete Circuits10 February 2010Spring 2010 The three parts below contain (A) a pull up network, (B) a pull down network, and (C) an expression to be implemented. For (A) and (B), complete the missing complementary switching networks so the circuit contains no floats or shorts and write the Boolean expression computed by the completed circuit. For (C), design the entire switching network. Assume the inputs and their complements are available.
OUTx = OUTy = OUTz = A ๎ B โ ๎^ C ๎^ D ๎
ECE 2030 A 10:00am 4 problems, 5 pages Problem 3 (3 parts, 24 points) Computer EngineeringExam One 10 February 2010Karnaugh MapsSpring 2010 Part A (12 points) For the follow expression, derive a simplified using a Karnaugh Map. Circle and list Out = A โ C โ D ๎ A (^) โ allB โ prime implicants, indicating which are essential. C ๎ A โ C โ D ๎ B โ C โ D ๎ sum of A โ B โ C products โ D expression
A
prime implicants essential?yes^ no
Part A (12 points) For the follow expression, derive a simplified using a Karnaugh Map. Circle and list all prime implicants, indicating which are essential.^ simplified SOP expression Out =๎ A ๎ B ๎ C ๎โ ๎ B ๎ C ๎ D ๎โ ๎ A ๎ B ๎ D ๎โ ๎ A product of sums ๎ B ๎ C ๎ D ๎ expression
A
prime implicants essential?yes^ no
simplified POS expression
ECE 2030 A 10:00am 4 problems, 5 pages Problem 4 (3 parts, 26 points) Computer EngineeringExam One (^) Mixed Logic Design10 February 2010Spring 2010 Part A (8 points) The following design has no supporting documentation. Derive the desired Boolean expression and the implementation cost (in CMOS transistors).
Part B (10 points) Now reimplement this expression using NAND gates and inverters. Use proper mixed logic notation. Determine the cost of this implementation (in transistors).
Part C (8 points) Implement the following expression using only AND and NOT gates. Use proper mixed logic notation. Determine the cost of this implementation (in transistors).^ # transistors = Out = A ๎ B โ C ๎ D
