fa09-sy-s1f

fa09-sy-s1f - ECE 2030 F Exam I Solutions September 15th,...

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

View Full Document Right Arrow Icon
ECE 2030 F Exam I – Solutions September 15 th , 2009
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. Fill in the missing entries in the following table Decimal 4-bit Binary 8-bit Binary 8 1000 00001000 11 1011 00001011 2. Say you were provided with the sequence of binary numbers below and told it was an ASCII string. Decode this string. 01000101 01011000 01000001 01001101 00110001 E X A M 1
Background image of page 2
3 3. Provide a transistor level implementation of a three input AND gate. Do not assume that you have complements of the input available. Use the minimum number of transistors.
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 4. The following is a correct CMOS implementation of a Boolean function F . However, you are told it is inefficient and F can be implemented with a smaller number of transistors. Provide a CMOS transistor implementation that computes F but uses less number of transistors. A B A C C B A B C A B C V dd F
Background image of page 4
5 F A B C A BC A C ( B B ) A C
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 5. This question deals with Mixed Logic Design. Implement the following expression using only NAND and NOT gates. Use the mixed logic notation we
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 9

fa09-sy-s1f - ECE 2030 F Exam I Solutions September 15th,...

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

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