Homework 4 Homework 4 is due on Wednesday October 18th by 11 59 PM Please submit your Homework on BlackBoard as a pdf file and follow the complete submission guidelines Homework Please ask all questions about this assignment during the office hours or post them on Campuswire Be sure to show your work on all your homework problems otherwise you risk not receiving credit It is recommended that you do not use a calculator or online tools etc when you do your homework Remember that there will be no calculators allowed on exams CMOS logic Boolean expressions minimization 1 CMOS Logic You may use CMOS gate layout tool to check your solutions a Fill in a truth table for the following CMOS circuit Write the Boolean expression of this circuit What logic gate does this circuit implement b Complete the following CMOS transistor level circuit by drawing the bottom half of the circuit from OUT to ground c Complete the circuit below so that it implements a NOR gate Specifically in each of the four boxes draw a p type or n type transistor as needed to implement a NOR gate d The transistor level circuit below implements the logic equation X AB C Label the inputs to all transistors The Boolean functions and f g with operands x y z are defined below by their truth tables 2 Canonical Forms x y z f g 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 1 1 0 1 1 0 0 0 0 1 0 1 1 1 0 1 1 2 Express function and function Express function g and function f f g fg in sum of minterms canonical SOP form in product of maxterms canonical POS form 3 Truth Table in C Copy the C program below This program generates the truth table for a three input OR function include stdio h int main int x y z f printf nTruth Table n printf x y z f n for x 0 x 1 x for y 0 y 1 y for z 0 z 1 z f x y z 1 printf d d d d n x y z f return 0 1 2 3 f Modify the program to print a truth table for function given by its canonical SOP form from your solution to problem 2 1 above Hints use operators and Compare the printout produced by your program to the truth table in problem 2 Turn in a printout of your program and the printout of the truth table the program produces as output Look at your modified code which produces the expected result as specified in Q1 line 16 Notice that each logic calculation uses bitwise operators and and that the last operation uses 1 to mask out all but the least significant bit Edit the code and remove the 1 operation from your answer to part 1 then recompile and re execute the code Turn in a printout of the truth table the program produces as output In fewer than 20 words e xplain why the function values appear as negative values in the resulting output bitwise f 4 Simplifying with K maps Functions F A B C D and G A B C D are specified by their Karnaugh maps shown below For each function 1 2 3 Circle on the K map and list all prime implicants Find a minimal SOP expression Is it unique If not give an alternative minimal SOP expression Find a minimal POS expression Is it unique If not give an alternative minimal POS expression 5 Simplifying with K maps Let G A B C D CD B CD A B C BD BA 1 2 Using a K map derive a minimal SOP expression for G Show your work Using a K map derive a minimal POS expression for G Show your work 6 C Program Modification Download or copy the following program erroneous answers for integer inputs that are negative valued and values for which their factorial exceeds 2 1 Your mission is to extend this program so that it accepts only those inputs that will produce correct outputs Hint Use a loop construct For each unacceptable input the program should print the appropriate warning message The input is not acceptable try again The code calculates the factorial of a number provided by the user Unfortunately the code gives asking the user to try again until a valid entry is given factorial c 31 a Create a flow chart for your new enhanced version of this program Turn it in as part of your homework solution Create a complete flow chart in a standard manner as showed in textbook and lecture By standard we need start and end proper use of boxes rectangles parallelograms etc conditions If you are uncertain of how to draw correct flow charts please refer to textbook chapter 13 There are plenty of examples b Write compile run test and debug your program code to confirm that it provides the correct output for integer inputs within 32 bit range Turn in a printo ut of your program code as part of your homework solution