an's 536 Combinatorial Circuits and Finite State Machines Chapter 10 8. 7. x y X y In Exercises 9-14, draw a circuit representing the given Boolean expression. 10. (x'A y) V [x A (y A z)] 12. (w Ax) V...

#16

Extracted text: an's 536 Combinatorial Circuits and Finite State Machines Chapter 10 8. 7. x y X y In Exercises 9-14, draw a circuit representing the given Boolean expression. 10. (x'A y) V [x A (y A z)] 12. (w Ax) V [(x V y') A (w Vx') 14. [x A (y Az)] A [(x' A y') V (z A w) 9.(xA y) V (x' V y) 11.) [(x A y') v (x' ^ y')] V [x' A (y v z)] 13. (y'Az)V[(w Ax') ^ y'l In Exercises 15-1 8, give the output value for the Boolean expression with the given input values. 15, (x V y) A (x' V z) for x 1, y = 1, z = 0 16. (x A y) V z] ^ [x V (y' ^ z)] for x = 0, y = 1, z = 1 17. [x A (yAz)]' for x 0, y 1, z = 0 18. [(x A (y Az)) V ((x A y) A z)] ^ (x vz') for x 0, y = 1, z = 0 qm: o - In Exercises 19-22, construct a truth table for the circuit shown. 20. x 19. x y у X y 22. x 21. х y- x X y y In Exercises 23-28, construct a truth table for the given Boolean expression. 23. x A (y V x') 25. (x A y) V (x^ y) 27. (x v y) v (x A z) 24. (x V y) V x 26. x V (x' A y) 28. [(x A y) A zl v [x A (y A z')] In Exercises 29-36, use truth tables to determine which pairs of circuits are equivalent. 29 수수 AA