http://www.allaboutcircuits.com/worksheets/sop_pos.html

Am I wrong but isn't the solution to question 16 on the link above:

SOP - ( A' . C' ) + ( B . C' ) + ( A . B' . C )

POS - ( B + C ) . ( A' + C ) . ( A' + B' + C )

The answers given don't seem to be the correct minimization; does that make them wrong? I was of the understanding that a POS or SOP term should be minimal?

 

Upliftmof0,

The answers given don't seem to be the correct minimization; does that make them wrong? I was of the understanding that a POS or SOP term should be minimal?

You are correct. The given answers are NOT minimized as they should be if you want to implement the smallest gate circuit. They do give the correct logical outputs, however. Your first answer for the SOP is correct, but your second answer for the POS is not. It should be (A'+B+C)(A+C')(B'+C') .

I would advise you to download the program at http://forum.allaboutcircuits.com/showthread.php?t=22347 so that you can easily check the correctness of a Boolean expression with respect to its logical output.

Ratch