No. 1 (10 points) The output Boolean function of a logic circuit is F(X, Y, Z) = X Y Z + X Y Z + X Y Z + X Y Z + X Y Z + X Y Z (i) Using this function construct a K-map. (ii) Find out the reduced function using the principle Karnaugh. No. 2 (10 points) The output Boolean function of a logic circuit is FA, B, C, D)-A BCDABCD ABCD+ABCD ABD ABCD+ABCD (i) Using this function Construct a K-map (ii) Find out the reduced function using the principle Karnaugh No. 3 (10 points) Using the 3-variable multiplexer chip of figure 3.12 (pp. 161 in the textbook 1, 6/e), implement a function whose output is the odd parity of the inputs. That is, the output is 1 if and only if an odd number of inputs are 1. No. 4 (20 points) The 3-variable multiplexer chip, shown in figure 3-12 (pp. 161 in the textbook 1, 6/e), is actually capable of computing an arbitrary function of four Boolean variables. Describe how, and as an example, draw the logie diagram for the function that is O if the English word for the truth table row has an even number of letters and 1 if it has an odd number of letters. No. 5 (10 points) Draw the logic diagram of a 2-bit demultiplexer, a circuit whose single input line is steered to one of the four output lines depending on the state of the two control lines. No. 6 (10 points) A common chip is a 4-bit adder. Four of these chips can be hooked up to form a 16-bit adder. How many pins would you expect the 4-bit adder chip to have? Why? (Draw a diagram of a 4- bit adder). SEC. 3.2 BASIC DIGITAL. LOGIC CIRCUITS 161 Dp In, It D, D, Its Ds It Figure 3-12. (a An eight-input multiplexer. (b) The same mukiplexer wired to compute the majority function