Explain the mathematical difference between the Product of Sums and the Sum of Products procedures of Boolean expressions
Think variables and complements
Products of Sums can be converted to Sums of Products by expanding. (A+B)(C+D) = AC + AD + BC + BD
I think that’s the general idea of conversion between the two. I just wanted the difference in definition and action between the two:
The difference is how the input variables and their complements are perceived. For SOP, the product terms are summed via Boolean algebra and are based on the values of the inputs. If you have ABC, the complements for input value 001 would be A and B, while C is not a complement. For POS, the opposite applies, where give 001, your complement would be C.
I’m not familiar with the in depth comparisons between these two, but those explanations above are my general understandings.
(Familiarized myself with this sort of terminology from the MIT invitational test release, so I’m not sure if this will match at all what will be on states or even nationals tests)
Bit of a sketchy question to ask, looking back, but nevertheless, your turn!