Computer Science

What is the Canonical form of Boolean expression? State the two types of Canonical forms.

Boolean Algebra

6 Likes

Answer

A Boolean expression in which each term has all the variables in complement or non-complement form is known as Canonical form of Boolean expression. The two types of Canonical forms are:

Sum of Product (SOP)
Product of Sum (POS)

Answered By

3 Likes

Computer Science

What is the Canonical form of Boolean expression? State the two types of Canonical forms.

Boolean Algebra

Answer

Related Questions

State the distributive law. Verify it using the truth table.

Verify that:
(Z + X)(Z + X' + Y) = (Z + X)(Z + Y)

Minimise the following expression. At each step clearly mention the law used.
Y.(A+B').(B+CD)'

Prove that F(a, b, c) = π(2, 3, 4, 7) = Σ(0, 1, 5, 6).

Computer Science

What is the Canonical form of Boolean expression? State the two types of Canonical forms.

Boolean Algebra

Answer

Related Questions

State the distributive law. Verify it using the truth table.

Verify that:(Z + X)(Z + X' + Y) = (Z + X)(Z + Y)

Minimise the following expression. At each step clearly mention the law used.Y.(A+B').(B+CD)'

Prove that F(a, b, c) = π(2, 3, 4, 7) = Σ(0, 1, 5, 6).

Verify that:
(Z + X)(Z + X' + Y) = (Z + X)(Z + Y)

Minimise the following expression. At each step clearly mention the law used.
Y.(A+B').(B+CD)'