00:01
Hello students, to write the boolean sum of the product that is the sop expression for the given truth table.
00:10
So we will identify the rows where the output is 1 and construct the expression that represents the o -rings of the corresponding input combination.
00:21
Then we will simplify the expression as much as possible.
00:25
Let's assume we have the truth table with the three inputs as the a, b and c and the one output as the y.
00:35
So to write the boolean sum of the sop expression for the truth table, we need to analyze the input and output combination where the output is 1 and construct the logical or expression for each of the combination.
00:54
Let's consider this simple truth table with the input values as a, b and c and the output as the y.
01:04
So the step one is to perform, step one is to write the sop expression where the sop expression is the sum of the products where each product term would correspond to the rows in the truth table where the output is 1.
01:31
So each product term is an and is the combination of an input where the sop expression for the given truth table it will be as the y is equal to the one that have been appeared.
01:45
So as for the one we have the a ' b ' c plus a ' plus b c plus a b ' c plus a b c...