CET 3116Digital Technology Homework #5 with correct answers highlighted

Document Content and Description Below

Question 8 Using Boolean algebra to simplify the expression Z = AB + A(B + C) + B(B + C), the completed first step would result in the expression: Z = AB + ABAC + BB + BC Z = AB + AB + C + BB + C ... Z = AA + AB + AB + AC + BB + BC Z = AB + AB + AC + BB + BC Question 9 Using Boolean algebra, the complete simplification of Z = AB + A(B + C) + B(B + C) gives us: Z = AB + AC + B Z = B + AC Z = AB = AC = BC Z = AB + AC + B + BC Question 10 Using Boolean algebra, the expression given for Y = above simplifies to: Y = BC + A'B'C + AB'C Y = BC + B'C Y = C Y = BC +BC' + A' Question 11 The implementation of simplified sum-of-products expressions may be easily implemented into actual logic circuits using all ________ with little or no increase in circuit complexity. OR gates AND gates NAND gates multiple-input inverters Question 12 Table 4-1 The truth table in Table 4-1 indicates that: The output (Z) is HIGH only when a single input is HIGH. The output (Z) is HIGH only when the majority of the inputs are HIGH. The output (Z) is HIGH only when the binary input count is an even number greater than zero. The output (Z) is HIGH only when the binary input count is an odd number. Question 13 Table 4-1 The circuit implementation of the sum-of-products expression for Table 4-1 would require (without minimizing): Three 3-input OR gates, one 2-input AND gate, and five inverters Three 3-input AND gates, two 3-input OR gates, and five inverters One 3-input OR gate, two 3-input AND gates, and five inverters Three 3-input AND gates, one 3-input OR gate, and three inverters [Show More]

Last updated: 1 year ago

Preview 1 out of 11 pages