sp99-sy-ef - 1 Cmpe 2030 A Introduction to Computer...

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

View Full Document Right Arrow Icon
1 Cmpe 2030 A Introduction to Computer Engineering Final Examination June 10 th , 1999 There are 14 questions and 19 pages. You also have an attachment with various figures and worksheets. Please make sure that you have all of them. This examination is closed textbook. No calculators, class notes or any material is allowed! 1. Please write/draw legibly. Use the work sheets for generating the solutions before provid- ing the final answer. 2. State any assumptions you feel you have to make or ask for clarification 3. Keep in mind it is difficult to give partial credit without written material. Please make sure you document any partial solutions. 4. All questions carry equal points (10 pts). Plan your work! 5.The exam is 2 hours and 50 minutes. Name:_________________________________________________ Student Number:_________________________________________ Question Graded 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Total
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 1. Provide a switch level implementation of the following expression using n-type and p-type switches. Assume that the complement of each signal is also available F A B =
Background image of page 2
3 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
4 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.
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 18

sp99-sy-ef - 1 Cmpe 2030 A Introduction to Computer...

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

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