Computer Science
Answer
Canonical sum of product(SOP):
This type of expression is formed by adding the product terms of the variables. For example, A + B can be written as A.1 + B.1 and A + BC can be written as A.1 + B.C
In the first example above, A.1 and B.1 are the two product terms which are added to form the given expression. Similarly, in the next example, A.1 and B.C are added to form the expression. Hence, they are sum of product expressions.
Canonical product of sum(POS):
This type of expression is formed by the product of the sum terms of the variables. For example, A.B can be written as (A + 0).(B + 0) and A.(B + C) can be written as (A + 0).(B + C).
In the first example mentioned above, A + 0 and B + 0 are the two sum terms which are multiplied together to form the expression. Similarly, in the next example, A + 0 and B + C are multiplied to form the given expression. Hence, they are product of sum expressions.
Related Questions
Reduce the following to its simplest form using laws of boolean algebra. At each step clearly state the law used for simplification.
A.B' + A'.B.C' + (A.C') + B.CSimplify a.b + a'.c + b.c using the laws of boolean algebra. At each step, state clearly the law used for simplification.
Simplify the following expression using laws of boolean algebra:
(a.b + x + y + z).(a.b + x'.y'.z')What is the application of boolean algebra in computer science?