Commutative law A-B= B.A Noe A+B = B+R issoriative law: (AsBd- = A (B.cy “08 (R+B)+c = At (B+c) (needy * a u \ os Ax (840), Tae Fua7 9999 didididiGedddeg ges 353599 Widedeha ude 5 ~ t [ aver] ar | Aas c | tae) [a0 is Qaalan 3 hve o | 0 \ 1 , oe ae eo \ 7 Ou ! \ 1 ie (ye onete 4 1 ia 1 1 Ti + 2 ‘ 1 1 oes ial [ee Siig See aJALIL LLL Lod PA [Say eo 4bADbD WoP Pa PoOUULULCL?E od 5 arvatus required: Laisa [Basic _{ 1) Commutative low 2) Associative Low: ~ Ex no:2 Veriaicanion 03 Bootern “THEOREMS Usine Io-10- 23 Drartar Lome Grates [Rims ates: To verify the Boolean Theovems using logic 9 S:No| Component Specification Quantity \ Ano Gate IC 1h08 \ ae {+ 2 OR Gate Se 1H32 1 a se | Sto 3 Not Gate | 1c 104 ' | ee ee a 4 y | Te Trainer kit i | stirs: Connecting wires | BooteaN LAWS - The binary operates, OR,,AND Is Said to be commutative If 1) AtB=BtR 2 ABs ‘The binary opevatod OR, AND 15 Said to be associative if 1, Ar(pro) = CArB)4C 2, A-(B-c) = (ABCjo Distributive lows oF Boolean Algebra Ae (B+e) =( A B)+ (Rec) A+( Bec) = (A+B) (AYO i a \ » aa e a Palas c2 . 3 Lupo prary ) fc nee nt | X= Alero) es, Jy Proof of Distributive tow eeu A lB oc | AB | Ac | (Ape (re) | (Bec) | A-(ete) ° ° ° 0 ° ° {eo 0 ° 5 ON 0, XO ° 1 o . ‘ ° iPr oa ARIE sale A | o a 4 i Ade IL LILI S SAAS SA SALAD i yySSS ac ii b LEVEE DOLE Lael ~~ » 3) Distributive laws The binary operator or, AND is sald to be distributive iF \ At (Baec) = (Ate). (AAC) 2) A: (atc) = (A:B)+ (Ac) 4) Absorption law : A+ ABSA ®% A+ Ae = Ate |5) Tnvolution Cov) Dowdle complement Jaws: ) _aaempolfnt : YA+AR =A 2, AeA =A 7) Complementary law: . WV AtAls 8) De =Mporgan’s Theovem: 1, The Complement of the sums equal to the product of the Individual complements: Ate = eB 2, ‘The complement of the product Is equal to the Sum of the individual complements. AB = A+BProot (ia. = DD PPI A spd PsA aA SSSA ARSee 0) proof of equation 40: Construct the two, circuits costsponding Gnd (Are)! Yesptctively: Show that for all combinations of A on the two cixcuits give Identical wesults. connect these drcults ond id 8, Verify then operations. |») proof _of equation (2): Construct two areults corresponding to the functions A‘+ 8! the two civcults give identical yesult: Connect these dvcults and Verify thely operat ons He will also use the following set of postulates: Pe: The identity element with vespect to» js one and + Is ZE¥0: There 15 no identity element with vespect to logical not: * Pa: The» and + operations are commutative - Py i * and + one distribstrve with respect to one anothes Thot is, As (ere) -(r-p)+ (Ac) ond Aale-c) = (A+B): (Are) Ps : ov every Jalue A there exists Oo value A such that A-pl=o ond ATA'=1. This yalut Is the logical complernent Cov NoT) of A+ Pe: + and+ ane both assonative. That \s, (A-B)-¢ = As (Bc) and (AtB)+¢ = At (Bre) You can prove all other theorems yn boolean a\gebva using these postulates: = to the functions A’! Gnd (A.8)' A.B, vespectively show that, for all combinations oF fA and B Pr: Boolean algebsa 1s closed under the AND, OR and. NOT operations -Tc oH -omplementasy law : Atapt=y A 5 bei i 3 & be leo mene ee he pol <2) Absoyption law: = ‘ meee 3 Tease ApAg=A . —— ALAB eA AxARe AB eo Tae A Bo | AB | AtAB oO oO ° oO 0 Sy rete oO _o = oo | fro ta \ 2 1 Toyolution (01) double complement low: Rea ‘ : eau [a Rie A lo ea © = 2 ofledeag © 4egi4} 7 4 LIAM TAT ISSA atesQD DAD AAG DB GAMLM MAM © DMO LD DDPPNLP LEE A! fA ti ie EO 4 1) Obtain the vequired re along ith Digitol tainty kit 2% Connect zevo volts te GND pin and +5 volts to vCC- 3 Reply the inputs to the vespectie (npue “pins - Wy verify the output with the truth table - the above stated Boolean laws are verified: