{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ee101_hw3

ee101_hw3 - EE 101 Homework 3 Fall 09 Redekopp Name Due...

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

1 EE 101 Homework 3 Fall ’0 9 ● Redekopp Name: _________________________________________ Lecture 9:30 / 12:30 / 2:00 Due: Tues. Sept. 29 th in class Score: ________ Show work to get full credit. Remember, use on only one side of the paper and staple them together. Only use a calculator to CHECK your work, not to DO your work. 1. (8 pts.) Using only 2-input NOR gates (as many as you like for each part), build a circuit that is equivalent to the following circuits. [Hint: Connecting a signal to both inputs of a gate is acceptable.] a. An inverter (Input x and output x’) b. 2-input AND gate (Inputs: x, y and output F = x and y) c. 2-input OR gate (Inputs: x, y and output F = x or y) d. Could a, b, and c, be accomplished using only NAND gates: Yes or No? 2. (6 pts.) Use the theorems of Boolean algebra to find minimal SOP or POS expressions for each of the following logic functions: a. F = (A+B )C D + C (A+B’)D + D(A+B ) b. )) ( ( ) ( ) ( z w x y x z w y x w y x w G 3. (18 pts.) Using a Karnaugh map, find both the minimal SOP and POS

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.

{[ snackBarMessage ]}