248spr01exam1

248spr01exam1 - min-term form Don’t simplify the...

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

View Full Document Right Arrow Icon
ECEN 248 Exam 1 Spring 2011 Exam time: 9:45 am to 10:45 am, February 15, 2011 Instructor: Prof. Weiping Shi, [email protected] Name: _______________________________________ Score: ___________________ 1. (5 points) Match the name and the invention by drawing a line between the name and the invention. If you can not find a match for a name or invention, leave that name or invention blank. Jack Kilby Transistors Claude Shannon Boolean algebra William Shockley Integrated circuits Gorden Moore Moore’s Law Samuel Morse Electromagnetic theory George Boole Application of Boolean algebra to circuits 2. (18 points) Convert the following numbers from the given base to the other two bases listed in the table: Decimal Binary Hexadecimal 35 100110.101 35 1
Background image of page 1

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

View Full Document Right Arrow Icon
3. (15 points) fill in each of the following truth tables with appropriate binary values: A B AND(A,B) 0 0 0 1 1 0 1 1 A B OR(A,B) 0 0 0 1 1 0 1 1 A B NAND(A,B) 0 0 0 1 1 0 1 1 A B NOR(A,B) 0 0 0 1 1 0 1 1 A B XOR(A,B) 0 0 0 1 1 0 1 1 2
Background image of page 2
4. (10 points) express the function given by the following truth table in the sum-of-
Background image of page 3

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

View Full Document Right Arrow Icon
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: min-term form. Don’t simplify the expression! A B C F 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 F = Σ ______________________________ 5. (10 points) express the function given by the following truth table in the product-of-max-terms form. Don’t simply the expression! A B C F 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 F = Π _______________________________ 3 6. (20 points) Consider Boolean equation F=ACD+C’D+ABD+A’DB’+BC a. Use K-map to derive minimum sum-of-product for F, and implement it with NAND gates. b. Suppose we do not care the output when BCD’ is true. Then use K-map to derive the minimum product-of-sum for F, and implement it with NOR gates. 4 7. (15 points). Use CMOS transistors to implement F=A’B’(C’+D’) 8. (7 points). Use PLA to implement F=AB’+CD 5...
View Full Document

{[ snackBarMessage ]}

Page1 / 5

248spr01exam1 - min-term form Don’t simplify the...

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