Page 38, 1-13 Simplify the Boolean function F together with the don't-care conditions "din (1) sum-of products form and (2) product-of-sums form. Use and show K-maps. F(w, x, y, z)- (0, 1, 2, 3, 7, 8, 10) d (w, x, y, z) 2 (5, 6, 1, 15) Page 38, 1-15 Amajority function is generated in a combinational circuit when the output is equal to 1 if the input variables have more 1's than 0's. The output is 0 otherwise. Design a three-input majority function. Simplify, give the boolean equation for, and draw your design. Show K-map. Page 38, 1-17 Show that a JK flip-flop can be converted to a D flip-flop with an inverter between the J and K inputs. Draw your answer. Do not give any explanation or other proof. Page 39. 1-20 Design a 3-bit count-up counter. This is a sequential circuit with three flip-flops. The state sequence is 000, 001, 010, Give Boolean equations for, and draw your final design 111, 000, and repeat. Use asynchronous T flip-flops for your design. Both page 3 2.12d Draw a network to realize the following function using only one AND gate and one OR gate: ABCABD ABE Roth page 78, 4.23 Which of the folowing statements are always true? Just circle or box which. You need not justify your answer: (a) If AB C, then ADBD CD (b) If AB AC A D, then B+C D (c) IA+B-C, then A+ B+ D-c+D (d) If AB C DC, then AB D Tanenbaum, page 156, #2 A missionary lost in Southern California stops at a fork in the road. He knows that two motorcycle gangs inhabit the area, one of which always tells the truth and one of which always lies. He wants to know which road leads to Disneyland. What question should he ask a gang member? Note that he does not know which gang the gang member belongs to