M16_2_Fall2008_Discussion_3

# M16_2_Fall2008_Discussion_3 - #3 Problem 1 Network of gates...

This preview shows pages 1–3. Sign up to view the full content.

EEM16 – Fall 2008 - DISCUSSION #3 Problem 1: Network of gates a) Is the gate , where A B = A.B’ universal? You may use constants 0 and 1 if needed. Prove your answer. b) Write the truth table for the following circuit: c) Write a switching expression for the circuit in part (a). d) Draw an equivalent circuit for the circuit in part (a) using fewer NAND gates (and no gates of any other type). The NAND gates may have any number of inputs. e) Show that the following circuit is combinational even though the circuit has a physical loop. f) A logic family uses the following ranges of voltages to represent high and low values: HIGH = 2.2 V to 3 V, and LOW = 0.0 V to 0.8 V. Consider a circuit with two inputs x and y, and an output z, and whose behavior for

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/24/2012 for the course EE M16 taught by Professor Cabric during the Fall '08 term at UCLA.

### Page1 / 3

M16_2_Fall2008_Discussion_3 - #3 Problem 1 Network of gates...

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

View Full Document
Ask a homework question - tutors are online