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
Main points of this past exam are: Mixed Logic Design, Switch-Level Design, Computer Engineering, Implementation Using N, Complements Are Available, Expression Below, TransistorsPossible, Expression Except, Expression Should Remain, Boolean Expression
Typology: Exams
1 / 5
This page cannot be seen from the preview
Don't miss anything!
4 problems, 5 pages Exam One 5 February 2004
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have 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!
Your Name ( please print ) ________________________________________________
1 2 3 4 total
4 problems, 5 pages Exam One 5 February 2004
Problem 1 (2 parts, 24 points) Switch-level Design
Part A (16 points) For each expression below, create a switch level implementation using N and P type switches. Assume both inputs and their complements are available. Your design should contain no shorts or floats. Use as few transistors as possible.
OUTx = ( A + B โ C + D + E )โ F OUTy = ( A + B )( C + D โ E + F )
Part B (8 points) Transform the following Boolean expression to a form where it can be implemented using switches (i.e., there should be no bars in the expression except for complements of the inputs A, B, C, etc.). The behavior of the expression should remain unchanged.
Out (^) X = ( A โ B โ C + E โ FD )โ G โ H =
4 problems, 5 pages Exam One 5 February 2004
Problem 3 (2 parts, 30 points) Karnaugh Maps
Part A (10 points) Given the following Karnaugh Map, circle and list all the prime implicants, indicating which are essential and write the simplified sum-of-products (SOP) expression.
prime implicants essential?yes no
simplified SOP expression Part B (20 points) Simplify the following SOP expression using a Karnaugh Map. Circle and list all the prime implicants, indicating which are essential and write the simplified product-of-sums POS expression.
Out = ABCD + ABC + BD + AC D
prime implicants
essential? yes no
Simplified POS expression
4 problems, 5 pages Exam One 5 February 2004
Problem 4 (2 parts, 16 points) Building Blocks
Part A (8 points) Implement a 2 to 4 decoder using only AND gates. Assume inputs signals IN 0 , IN 1 , and En and their complements are available. Label all inputs and outputs.
Part B (8 points) Consider a priority encoder with the following behavior:
In 3 In 2 In 1 In 0 O 1 O 0 Valid 0 0 0 0 X X 0 0 0 0 1 0 0 1 0 0 1 0 0 1 1 0 0 1 1 0 0 1 0 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 1 0 1 0 1 0 1 1 1 1 0 1 1 0 0 0 1 1 1 1 0 0 1 0 0 1 1 0 1 0 1 1 1 1 0 1 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 0 1 1 1 1 0 1 0 1 1 1 1 1 1 0 1
List the inputs (In 0 , In 1 , In 2 , and In 3 ) in increasing priority.
lowest priority 2 nd^ lowest priority 2 nd^ highest priority highest priority
