the redundance law of boolean algebra equation
Answers
The basic Laws of Boolean Algebra that relate to the Commutative Law allowing a change in position for addition and multiplication, the Associative Law allowing the removal of brackets for addition and multiplication, as well as the Distributive Law allowing the factoring of an expression, are the same as in ordinary ...
AND, OR, XOR, and NOT to compare values and return a true or false result. These boolean operators are described in the following four examples: x AND y - returns True if both x and y are true; returns False if either x or y are false.
Answer:
Redundancy law Boolean algebra
Laws and Theorems of Boolean Algebra
10a. X • (X + Y) = X Absorption Law
11a. (X + Y) • (X + Y) = X Redundancy Law
12a. (X + Y) • Y = XY Redundancy Law
13a. (X + Y) • (X + Z) • (Y + Z) = (X + Y) • (X + Z) Consensus Law
13b. X Y + X Z + Y Z = X Y + X Z Consensus Law
Step-by-step explanation:
Redundancy theorem is used as a Boolean algebra trick in Digital Electronics. It is also known as Consensus Theorem: AB + A'C + BC = AB + A'C. The consensus or resolvent of the terms AB and A'C is BC.
The basic Laws of Boolean Algebra that relate to the Commutative Law allowing a change in position for addition and multiplication, the Associative Law allowing the removal of brackets for addition and multiplication, as well as the Distributive Law allowing the factoring of an expression, are the same as in ordinary