Name: 1CSE 240 Autumn 2004DUE: Fri. 24 September 2004Intro. to Computer Architecture Homework 2Write your answers on these pages. Additional pages may be attached (with staple) if necessary. Please ensure thatyour answers are legible. Please show your work. Due at the beginning of class. Hints are provided for questionsmarked with [ ] on the last page of the assignment. Total points: 48.1. [4 Points] Transistors. In the circuit given below, the transistors are shown as circles (just like in the circuits inFigures 3.4 and 3.5 of the textbook). In this problem you must determine whether or not each of these transistorsconduct or not based on the inputs (A and B).For all values (i.e., 0 or 1) of inputs A and B indicate in the table below whether each transistor conducts (i.e.,act like a piece of wire, denoted “1”) or does not conduct (i.e., acts like an open circuit, denoted “0”). Alsoindicate the value (i.e., 0 or 1) of the output C. (In the table, the upper and lower p-type transistors are called p-up and p-down, respectively, while the left and right n-type transistors are called n-left and n-right, respectively.)A B C P-up P-down N-left N-right0 00 11 01 122. [8 Points] Logic Gates.(a) The transistor-level circuit given below implements the following logic equation.Y = NOT(A) OR ( NOT(B) AND NOT(C))Label all the transistor “gate” inputs with the input (i.e., A, B, or C) that should be applied to it. Also labelthe output (wherever it may be) with Y.(b) Construct a transistor-level circuit (like the one above) for the following logic equation.Z = NOT(A) AND ( NOT(B) OR NOT(C))Be sure to include labels for A, B, C, and Z.Name: 33. [12 Points] Combinational Logic Circuits. NAND is logically complete. Use only NAND gates to constructgate-level circuits that compute the following.(a) NOT(b) AND4(c) OR(d) NORName: 54. [12 Points] Combinational Logic Circuits.(a) i. Complete the truth table for Z = (A AND B) OR (B AND C).A B C Z = (A AND B) OR (B AND C)0 0 00 0 10 1 00 1 11 0 01 0 11 1 01 1 1ii. Construct the gate-level logic circuit for Z (above) using AND and OR .iii. How many transistors does your circuit require if AND and OR gates are implemented as given inFigures 3.6 and 3.7 of the textbook (pages 56 and 57)?6(b) i. Complete the truth table for Y = NOT( NOT(A AND B) AND NOT(B AND C)). You should findthat Y is equivalent to Z (from previous question). Indeed, Y can be reduced to Z by application ofDeMorgan’s Law (and the fact that NOT( NOT(X)) = X).A B C Y = NOT( NOT(A AND B) AND NOT(B AND C))0 0 00 0 10 1 00 1 11 0 01 0 11 1 01 1 1ii. [ ] Construct the gate-level logic circuit for Y (above) using only NAND gates.iii. How many transistors does your circuit require if NAND gates are implemented as described in Fig-ure 3.7 of the textbook (page 57)? Does the NAND -based implementation require a greater or lessernumber of transistors than the AND - OR implementation?Name: 75. [12 Points] Combinational Logic Circuits. In this problem we will construct gate-level logic circuits to deter-mine whether a number is zero, negative, or positive. For each part, below, assume the input (A3, A2, A1, A0)represents a 4-bit 2’s complement integer (A0representing the least significant digit). You may use any logicgates discussed in the textbook (including gates with more than two inputs, e.g., 4-input AND gates).(a) Output Z is 1 if and only if the input represents zero. Construct the gate-level logic circuit to produceoutput Z from the input. Be sure to label your inputs (A3− A0) and output (Z).(b) [ ] Output N is 1 if and only if the input represents a negative number. Construct the gate-level logiccircuit to produce output N from the input. Be sure to label your inputs and output.(c) [ ] Output P is 1 if and only if the input represents a positive number. Construct the gate-level logiccircuit to produce output P from the input. Be sure to label your inputs and output.86. [No Points] Last and Most Important Question! Please complete this question, and give us your feedback!(a) How many hours did you spend on this assignment?(b) On a scale of 1-5, how difficult did you find this assignment? (1-easiest, 5- most difficult)(c) Do you have any other comments on your experience completing this assignment? What are they?Hints:4bii: Note that NOT(A AND B) = (A NAND B).5b: This may not sound like a hint, but. . . This one is really as easy as you think!5c: You may use logic for Z and N to implement the logic for