Laws and Rules of Boolean algebra In simpificat understanding these laws and rules of Boolean algebra, understand the Boolean operations addition and multiplication concept. of the Boolean expression, the laws and rules of the Boolean algebra play an Important role, Before Boolean Addition The addition operation of Boolean algebra is similar to the OR operation, In digital circuits, the OR operation is used to calculate the sum term, without using AND operation. A+B, A + B', A+B + Cand A’ + B + + D' are some of the ‘examples of 'sum term’, The value of the sum term is true when one or more than one literals are true and false when all the literals are false. Boolean Multiplication The multiplication operation of Boolean algebra is similar to the AND operation. In digital circults, the AND operation calculates the product, without using OR operation. AB, AB, ABC, and ABCD are some of the examples of the product term, The value of the product term is true when all the literals are true and false when any one of the literal is false. NEW YE, Laws of Boolean algebra There are the following laws of Boolean algebra: Commutative Law This law states that no matter in which order we use the variables. It means that the order of variables doesn’t matter, In Boolean algebra, the OR and the addition operations are similar. In the below diagram, the OR gate display that the order of the input variables does not matter at all. For two variables, the commutative law of addition is written as:Commutative laws A _8 : ABE iy BHA For two variables, the commutative law of multiplication is written as: AB=BA Commutative laws A B: AB B.A B. A Associative Law ‘This law states that the operation can be performed in any order when the variables priority is same, As '*" and '/" have same priority. In the below diagram, the associative law is applied to the 2-input OR gate. For three variables, the associative law of addition Is written as: A+ (BHC)=(A+B)+C Associative Laws For three variables, the associative law of multiplication is written as: A(BC) = (AB)C ‘According to this law, no matter in what order the variables are grouped when ANDing more than two variables. In the below diagram, the associative law is applied to 2-input AND gate. Associative Laws A+(B+C) _ A+B B+C (A+B)+C e ¢: Distributive Law:According to this law, if we perform the OR operation of two or more variables and then perform the AND operation of the result with a single variable, then the result will be similar to performing the AND operation of that single variable with each two or more variable and then perform the OR operation of that product. This law explains the process of factoring For ree variables, the distributive law is written as: A(B+C)=AB+AC Distributive law 8 ry B+C “iD. ne AC ut < Y=A(B+C) Y=AB+AC Rules of Boolean algebra ‘There are the following rules of Boolean algebra, which are mostly used in manipulating and simplifying Boolean expressions. These rules plays an important role in simplifying boolean expressions, 1 Ato=a 7 Ad 2 Atiet 8 Aa'=0 3. Ao=0 9 4 a. 10. Atat 5. Athen 14. APAB=ALB 6. At=L 12. (A+B)(aHc)=avec Rule 1:A+0=A Let's suppose; we have an input variable A whose value is either 0 or 1, When we perform OR operation with 0, the result will be the same as the input variable. So, if the variable value is 1, then the result will be 1, and if the variable value is 0, then the result will be 0. Diagrammatically, this rule can be defined as: A=1 ‘Y=0 0: Rule 2: (A+ 1)=14 Let's suppose; we have an input variable A whose value is either 0 or 1. When we perform OR operation with 1, the result will always be 1, So, ifthe variable value is elther 1 or 0, then the result will always be 1, Diagrammatically, this rule can be defined as:Y=1 Y=1 Rule 3: (A.0) = 0 Let's suppose; we have an input variable A whose value is either 0 or 1. When we perform the AND operation with 0, the result will always be 0. This rule states that an input variable ANDed with 0 is equal to 0 always. Diagrammatically, this rule can be defined as: X=A.0=0 A=1 A=0: Y=0 Y=0 oO 0 Rule 4: (A.1) =A, Let's suppose; we have an input variable A whose value is either 0 or 1. When we perform the AND operation with 1, the result will always be equal to the input variable. This rule states that an Input variable ANDed with 1 Is equal to the input variable always. Diagrammatically, this rule can be defined as: A=0. -Y: 1 Rule 5: (A+A)=A Let's suppose; we have an input variable A whose value is either 0 or 1. When we perform the OR operation with the same variable, the result will always be equal to the input variable. This rule states an input variable ORed with itself is equal to the input variable always. Diagrammatically, this rule can be defined as: (A+A)=A A=0 A= Y=0 Yat A=0: A=1 Rule 6: (A+ A’) =1 Let's suppose; we have an input variable A whose value is either 0 or 1. When we perform the OR operation with the complement of that variable, the result will always be equal to 1. This rule states that a variable ORed with it complement is equal to 1 always. Diagrammatically, this rule can be defined as:(A+A)=1 Y=1 Y=1 > iw >| if o Rule 7: (A.A) =A. Let's suppose; we have an input variable A whose value is either 0 or 1. When we perform the AND operation with the same variable, the result will always be equal to that variable only. This rule states that a variable ANDed with itself Is equal to the input variable always. Diagrammatically, this rule can be defined as: (AA)=A A=0—J azi— Y=0 ‘=1 A=0— A=1— Rule 8: (AA') = 0. Let's suppose; we have an input variable A whose value is either 0 or 1. When we perform the AND operation with the complement of that variable, the result will always be equal to 0. This rule states that a variable ANDed with its complement is equal to 0 always. Diagrammatically, this rule can be defined as: (A.A‘)=0 A=0—f A=1 ‘Y=0 Y=1 A=0. A=1 Rule 9: A= (Ay This rule states that if we perform the double complement of the variable, the result will be the same as the original variable. So, when we perform the complement of variable A, then the result will be A’, Further if we again perform the complement of A’, we will get A, that is the original variable, A=(Ay’ A fst f Sto of sets Rule 10; (A+ AB) =A We can prove this rule by using the rule 2, rule 4, and the distributive law as: Factoring (distributive law) Rule 2: (1+ B)=1 Rule4A1=ARule 11:A+AB=A+B We can prove this rule by using the above rules as: A+AB=(A+AB)+AB Rule 10:A=A+AB AvABs (AA + AB)+ AB Rule 7:A=AA AVABSAA AB 4+AA +AB Rule 8: adding AA = 0 Ava Factoring Asal Rule: A+A=1 AeA Rule 4: drop the 1 0 1 ° ° Rule 12: (A+ B)(A+C)=A+BC We can prove this rule by using the above rules as: (A+ B)(A+ C= AA + AC + AB + BC Distributive law (A+B)(A+O2A+AC +AB+ BC Rule 7: AA (A+ B)(A+C)=A(1+ 0+ AB + BC Rule 2:1+C=1 (A+ BYA+C)-A1+AB+ BC Factoring (distributive law) (A+ BY(A + C)= AC + B)+ BC Rule 2:1+B=1 (A+B)(A+C)=A1 + BC Ruled: A=A, (A+B)(A+C=A+BCo/o;o}o]o 0 o}o >, o}o}1}o]}o o o| 0 [ )- o}ifola]a 0 ol} o “pl oli}i}a]a 1 ata ¢ tlolo}a]a 1 o|1 | thola}a}a 1 o}1 & tiafo}a}a 1 o}1 vlatlatala 1 aia cf aut © For Videos Join Our Youtube Channel: Join Now Help Others, Please Share ® HRONEe The 7-Step Guide to you Employee Performance! DOWNLOAD NOW Learn Latest Tutorials § 9 od Postgres. Solr MongoDB. imp Veriog ‘Teradata PhoneGap Grail Vues Pc. Masetor Preparation@ ®@ Aplitade Reasoning t Company Trending Technologies af anon al aws Blockshain Git B.Tech / MCA DP PMS mio — BY Data ans ‘not bs [B compurr Bp Comper Recwerktuorist — “Basgn .Newwor Compiler. bain DB Compuce Tiacking Tutorial Graphics Tetra Hacking Graphics Zoe By Automata Security ttriat Tera oper Sec Automata DBpwvasoriat Qh Net Framework Java tutor Net Verh . Selenium D, Science ML DAPAA tuorat DAA Be compe Sigasization and "Areioctre con Be Sonware Bagineerng “Tutorial Software F Changupe ‘sonal © BiPhono Python * Interview db ud Open ‘Sytem moral os Dy. Dascexe ‘Matematcs “Tetoral Mat [Dipti Web Teck [Bact ear oH Dy Lisoe Programs ProgramsBCom BB Das Mining Bistems tuorat “Tutorial, Conta 8 ata Mining