Ask your own question, for FREE!
Computer Science 15 Online
OpenStudy (anonymous):

Boolean Logic: reduce to a minimum sum-of-product form: X'Y'Z' + X'YZ + XYZ X'Y'Z' + X'Y'Z + XY'Z + XYZ' for the first one, I have it down to X'Y'Z' + YZ, but is there anything more I can do that I'm not seeing?

OpenStudy (anonymous):

|dw:1327917442864:dw| X'Y'Z' + YZ no other solution for sure ... you are welcome

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!