


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
The solutions to exam one for the computer engineering course ece 2030b, offered in spring 2009. The exam covers various topics, including switch-level design, mixed logic reengineering, boolean algebra, and karnaugh maps. Students are required to complete incomplete circuits, implement boolean expressions using specific gate types, transform boolean expressions for switch-level implementation, and derive simplified expressions using karnaugh maps.
Typology: Exams
1 / 4
This page cannot be seen from the preview
Don't miss anything!



4 problems, 4 pages Exam One Solutions 4 February 2009
Problem 1 (2 parts, 20 points) Switch-level Design
Several incomplete circuits are shown below. Complete each circuit by adding the needed switching network so the output is pulled high or low for all combinations of inputs (i.e., no floats or shorts). Complete each circuit (pull down, pull up, or both) and write the expression if one is not given. Assume both inputs and complements are available.
A D E
B C F
OutX OutY
A
B
C
D
E
F
A
B
C
F
E
A
B C
E F
OUTy = ( A + B โ C )โ E โ F
4 problems, 4 pages Exam One Solutions 4 February 2009
Problem 2 (2 parts, 28 points) Mixed Logic Reengineering
For the following expressions, implement the Boolean expression using the specified gate type. Use correct mixed-logic notation. Do not simplify the expression. You may use multi-input gates. Minimize the total transistors (switches) required. When possible, use common subexpressions to reduce gate counts. Also determine the number of switches used in each implementation.
Part A (14 points) Implement A โ ( B + C )โ (( B + C )+ D + E )using only AND and NOT gates.
A B C
D E
Out
Part B (14 points) Implement A + ( B โ C + D )+ E โ F using only NAND and NOT gates.
A B C D E F
Out
4 problems, 4 pages Exam One Solutions 4 February 2009
Problem 4 (2 parts, 30 points) Karnaugh Maps
Part A (12 points) Given the following Karnaugh Map, circle and list all the prime implicants for a product-of-sums (POS) expression, indicating which are essential. Derive the simplified POS expression.
prime implicants
essential? yes no
0
Part B (18 points) For the following expression, derive a simplified sum of products expression using a Karnaugh Map. Circle and list all the prime implicants for a sum-of-products (SOP) expression, indicating which are essential.
Out =( B + D )โ ( A + B + D )โ ( A + B + C )
prime implicants
essential? yes no
simplified SOP expression (^) A โ B + B โ C + A โ B โ D