Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Proper Mixed - Computer Engineering - Solved Exam, Exams of Computer Science

Main points of this past exam are: Proper Mixed, Incomplete Circuits, Circuit, Combinations of Inputs, Pulled High, Pull Down, Pull Up,, Complete Each Circuit, Mixed Logic, Mixed Logic Notation

Typology: Exams

2012/2013

Uploaded on 04/08/2013

sawant_111
sawant_111 🇮🇳

5

(1)

67 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 2030 Computer Engineering Fall 1999
4 problems, 3 pages Exam One Solutions 17 September 1999
1
Problem 1 (3 parts, 30 points) Incomplete Circuits
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 the inputs and their compliments are available.
OUTx = )()( FEDCBA +++ OUTy = )( DCBA +OUTz = ))(( EDCBA +++
Problem 2 (2 parts, 24 points) Mixed Logic
Part A (12 points) Implement the following expression using only two NAND gates, two NOR
gates, and one inverter. Use proper mixed logic notation. Do not modify the expression. Do not
assume compliments of inputs are available.
ECDABOut )( +=
pf3

Partial preview of the text

Download Proper Mixed - Computer Engineering - Solved Exam and more Exams Computer Science in PDF only on Docsity!

4 problems, 3 pages Exam One Solutions 17 September 1999

Problem 1 (3 parts, 30 points) Incomplete Circuits

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 the inputs and their compliments are available.

OUTx = ( A + B ) C + D ( E + F ) OUTy = A B ( C + D ) OUTz =^ (^ A^ + B + C )( D + E )

Problem 2 (2 parts, 24 points) Mixed Logic

Part A (12 points) Implement the following expression using only two NAND gates, two NOR gates, and one inverter. Use proper mixed logic notation. Do not modify the expression. Do not assume compliments of inputs are available.

Out =( AB + CD ) E

4 problems, 3 pages Exam One Solutions 17 September 1999

Part B (12 points) Implement the following expression using only NOR gates and inverters. Then determine the number of switches required. Use proper mixed logic notation. Do not modify the expression. Do not assume compliments of inputs are available.

Out =( A + B ) C ( D + E ) F

number of switches 24

Problem 3 (3 parts, 18 points) Switch-Ready Expressions

Transform each of the following boolean expressions to a form where they 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 = AB + CD +( E + F ) ( A^ +^ B ) CD + EF

OutY = A + B + C + D (^ A^ + B )( C + D )

Out (^) Z = ABCD A (^ B +^ C )+ D

Problem 4 (3 parts, 28 points) Karnaugh Maps

Part A (6 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 = ABCD + BCD + AB + B D