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
A computer engineering exam from spring 2001. It consists of 4 problems, each with multiple parts, totaling 100 points. The exam covers topics such as switch level implementation using n and p type switches, mixed logic notation, 4 to 2 and 2 to 4 encoders and decoders, and karnaugh maps. Students are required to create switch level implementations, extract output expressions, describe corresponding outputs, and simplify sum of products and product of sums expressions using karnaugh maps.
Typology: Exams
1 / 5
This page cannot be seen from the preview
Don't miss anything!
4 problems, 5 pages Exam One 9 February 2001
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 9 February 2001
Problem 1 (3 parts, 30 points) Incomplete Circuits
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, but do not simplify the expression.
OUTx = A โ B + A โ B OUTy = A + ( B โ C )+ D OUTz = ( A + B + C )โ ( D + E )
4 problems, 5 pages Exam One 9 February 2001
Problem 3 (1 part, 15 points) Building Blocks
Consider the following circuit. For each combination of inputs listed below, describe the corresponding outputs.
In 0
In^1
In 2
In (^3) In 3 > In 2 > In 1 > In 0
Out 0
Out 1
V
In 0
In 1
En
Out 0
Out^1
Out 2
Out 3
Problem 4 (3 parts, 30 points) Karnaugh Maps
Part A (10 points) Describe the behavior of the following expression by completing the entries in the Karnaugh Map. You only need to put a 1 and 0 in each box. Do not simplify.
Out =( A + C + D )โ ( A + B + C + D )โ ( B + C + D )โ ( A + C + D )
4 problems, 5 pages Exam One 9 February 2001
Part B (10 points) For the following behavior (in map format), derive a simplified sum of products expression using a Karnaugh Map. Circle and list the prime implicants, indicating which are essential. Then write the simplified SOP expression.
prime implicants
essential? yes no
simplified SOP expression
Part C (10 points) For the following behavior (in map format), derive a simplified product of sums expression using a Karnaugh Map. Circle and list the prime implicants, indicating which are essential. Then write the simplified POS expression.
prime implicants
essential? yes no
simplified POS expression
