sp99-sy-e3 - Cmpe 2030 A Introduction to Computer...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Cmpe 2030 A Introduction to Computer Engineering Final Examination June 10 th , 1999 There are 15 questions and 11 pages including the cover sheet and two blank work sheets and three data sheets. Please make sure that you have all of them. This examination is closed text- book. No calculators, class notes or any material is allowed! 1. Please write legibly. Use the work sheets if you need to. 2. Please show all of your work 3. State any assumptions you feel you have to make or ask for clarification 4. Keep in mind it is difficult to give partial credit without written material. Please make sure you document any partial solutions. 5. All questions carry equal points. Plan your work! 6.The exam is 2 hours and 50 minutes. Name:_________________________________________________ Student Number:_________________________________________ Question Points Graded 1 15 2 15 3 20 Total 50
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
1. Provide a switch level implementation of the following expression using n-type and p-type switches. F A B =
Background image of page 2
2. Complete the following switch level circuit by designing the pull down network. Fill in the truth table and provide expressions for OUT, OUT , SOP using minterms and POS using maxterms. A B C C Out = ___________________________________________ Out = ___________________________________________ SOP = ___________________________________________ POS = ___________________________________________ Truth Table A B C Out Out
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
3 Implement the following expression using only NAND and NOT gates. Use the mixed logic notation we have used in class. Do not assume that the complements of the inputs are avail- able. Do not simplify the expression. Provide the number of transistors in the implementa- tion. # Transistors = ____________ F A B + ( 29 C A C BCD + + =
Background image of page 4
4 This questions deals with logic minimization using K-Maps.
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/16/2009 for the course COMP ENG 2031 taught by Professor Willis during the Spring '09 term at Georgia Tech.

Page1 / 19

sp99-sy-e3 - Cmpe 2030 A Introduction to Computer...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online