sp99-sw-e1 - ECE 2030 4 problems, 5 pages Computer...

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

View Full Document Right Arrow Icon
ECE 2030 Computer Engineering Spring 1999 4 problems, 5 pages Exam One 16 April 1999 1 1234 t o t a l 30 20 18 32 100
Background image of page 1

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

View Full DocumentRight Arrow Icon
ECE 2030 Computer Engineering Spring 1999 4 problems, 5 pages Exam One 16 April 1999 2 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 inputs and compliments are available. OUTx = _____________________ OUTy = _____________________ OUTz = ) )( ( E D C B A + +
Background image of page 2
ECE 2030 Computer Engineering Spring 1999 4 problems, 5 pages Exam One 16 April 1999 3 Problem 2 (2 parts, 20 points) Mixed Logic Part A (10 points) Implement the following expression using only NAND 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.
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/16/2009 for the course COMP ENG 2031 taught by Professor Willis during the Spring '09 term at Georgia Institute of Technology.

Page1 / 5

sp99-sw-e1 - ECE 2030 4 problems, 5 pages Computer...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online