$$$ Boorman Arcrprra {5.. Boolean Algebra one unary operation ' and two distinct elements 0 and 1. Bis aalled a Boolean Algebra if the following ax ‘ioms hold : 1. For every pair of elements a, b in B @ atb=b+a (i) a-b=b-a (Commutative laws) For all elements a, b, cin B @ a-(b+e)=(a-b)+(a-c) (ii) a+ (b-c)=(a+b)-(a +e) Cistributive laws) For every element ain B @)a+0=a Gi) a-l=a (Identity law) 4. Forevery clement a there is an element a’ in Bsuch that @ata’=1 i) a-a'=0 (Complement laws) Note: (1) We designate it as “(B, +, 0, 1 ) is a Boolean Algebra”, (2) The element 1 is‘called unit element and the element is cal led the zero element. (3) a! is called complement of a : (4) We usually drop the symbol . and use juxtaposition, “¢., instead of writing a-b we shall write ab in Practice. (8) +is called ‘sum’ (not arithmetic a and aoe broduct’ (not arithmetic product) and 'is calle om = (6) Conventionally the operation has precede oe aiee 7 °Peration . and . has precedence over +. Mi pert: *(y!) and not (x-y) jx+y-2 means x+( Scanned with CamScannerIllustrative Examples. Let Sbe aset. Then its power set P(S) (set of ay of S) is a Boolean algebra under the operations , rm (intersection),’ (complement) with @ (null set) as zero and S as unit. Since 4UB=BUA and AMB=BOA 80 the commugs, property hold : Since Ag (BUC)=(ANB)U(ANC) AU(BAC)=(ALB) A(AUC) so the distributive law hold Hobe, (unig elegy ang Since 4U@=4 and ANS=A s0 the Identity law is valig Since AU A’=S and An A’=@ so the complement laws ay hold. So (P(S),U,7,',®, S) is a Boolean Algebra. (ii) Let Dy ={1,2,4,5,8, 10, 20, 40} is the set of divisors of Let v,~ and —are defined as avb= LCM of a, bjanb=HO ofa, band 7=2° . Then (Dy,v.A, —+ 1, 40) is not a Boolst Algebra. é Since LCM of a,b= LCM of b,a and HCF of a,b= HCFdfbe so avb=bva and anb=baa showing the validity“ commutative property. s Since HCF of a and LCM of b,c= LCM of (HCF of a, 0 (HEF of a, 0) so aa(bve)=(and)v(anc). Similath av(bAc)=(avb) (ave) hold. This shows that the distributi* law hold. . Since LCM of a and 1=a and HCF of a and 40=a (5% ” factor of 40) 0 av1=a,an40=a. This shows Identity 18% valid 7 But 2v2=2v20= LCM of 2 and 20 =20240- TH si complement laws are invalid. Hence (Dio, ¥,A, —,1,40) is nota Boolean Algebr: pooLEAN ALGEBRRA (ii) Let the set of all factors of 79, Dy ={1,2+5, 7,10, 14,35, 70}. Let y and , are defined avb=LCM of a, bs anbaHcr of gy. a ses (Dos > 1, 70) isa Boolean Algebra, = 2 (iv) (An Important Boolean Algebra) Let B={0,l} be a set. The three operations +, . and‘ are defined as +|:]o -| iro afo rfaifa tla o}1fo ol ole | Bis a Boolean Algebra w.r.t the above operations, From the very definition of the operation we see all the axioms of Boolean Algebra are valid. For instance 0+1=1=1+0 ete. So B,+,., 50, 1) is a Boolean Algebra. (v) Let B={0,1} be a Boolean Algebra as defined in the Previous example. Let BY =BxBxBx--xB={(x),x2,-%s): each x, €B}. Then B" is a Boolean Algebra w--t the operation +,-and' defined by Since x+y, ¢B,xj-y; eB and aj €B forall x,y: in B. e+, tjons and ‘is uniary operation on B + are binary operat Let us y, erify the axioms of Boolean Algebra: * o (s. 7 ky) + p22" mn) = (ape an +n) 2) Scanned with CamScannerwfepsneg)- burp eet (ii) Similarly it can be shown, that fy » brea) {epee +b on) lee iy) Ee So distributive law hold. 3. {(xpxg%,)409 o)} = (x, +0,29 +00 4%, +0) =e) Gi (xp xgsx,) be = (bay lesen) i Jeet So, the identity law hold. Here (0,0,-~,0) is the zero d and (1,1,-y1) is unit element. € (> o%20-%4) (e220 n) nies = the unit element. Gi (Hp t20 Fa) Qos) eberetar Fa) Piet) ea aga 0)= the zero clement, ‘thus all the axioms are valid in gt, So B” is a Boolean Algebra, 4.5.2. Duality in Boolean Algebra, Ina Boolean Algebra (8, +,,,0,1) the dual of any statement is defined to be the statement thats obtained by interchanging +and . ; 0 and 1 in the original statement. For example the dual of the statement ‘(a+0)+(I-c')=1" is the statement @-1)-O+a")=0". Principle of Duality in a Boolean Algebra If a Theorem hold in a Boolean Algebra then another ‘Theorem is obtained which is nothing but the dual of the former. This follows from the fact that the dual of each axiom of a Boolean Algebra also comes as an axiom. Theorem 1, (Idempotent Laws) 0,1) Ina Boolean algebra (B,+, @ ata=a Gi) a-aza Proof. (i) a+a=(a+a)-1 =(a+a)-(a+a') =a+(a-a') by distributive law y is unit element ++ a’ is complement ofa =a+0=a. __ Though (i) follows from (i by principle of duality we give the independent proof. Una 29 Scanned with CamScanner4-162 Gi a-an(o-a)+0 0s sorocloment plement. =a-at(a-a') istributive property | sa-(a+a’) by salea (Boundedness Law) *,0,1) ‘Theorem 2. Ina Boolean Algebra (B,+ @ a+1=1 (ii) a-0=0 Proof, (i) a+1=(a+l)-1 ¥ 1 isunit element a’ is complement of a =(a+1)-(a+a’) « =a+(I-a’) by distributive law =a+(a’-l) by commutative law =a+a’=1 by complement law (i) Similar or follows from (i) by principle of duality, Theorem 3. (Absorption Laws) In a Boolean Algebra (B,+,+'0,1) @ a+(a-b)=a | Gi) a-(a+b)=a (W.B.U.Tech 200, Proof. (i) Similar to (ii) | (ii) a-(a+b) =(a+0)-(a +8) =a+ (0-8) by distributive prepet =a+(b-0)=a+0=a, Theorem 4. (Associative Laws) In a Boolean Algebra (B,+,°,',0,1) (i (a+b)+e=a4(b+0) Gi) (a-b)-c=a-(b-e) [ W.B.U Proof. (i) Let x=(a+b)+¢ and y=a+(b+e)we shi that a-x=ary, yoolZAN ALGEBRA Now, wee a(a+8)sc)e “16 by Sbsorotion Lay =a by Absorption Lay and @¥=4°(0+(b40)) (4.9) =4+(4-(b+¢) by ide =a+(az) lose) ae een Law =a by Absorption Lay Thus ax=a-y Next we shall show a’. ag". es Now, a'-x=a".((a+8) +0) 2a'-(a+b)+(a!-c) by distributive Lay =((a'-)+(a"-0)) +(a’-c) by distributive Le. (0+ (a"-b)) +(a"-c) = = =a'-(b+e) (a1-b)+(e-c) since 04s zero clement and a" y=a'-(a+(b+0))=(a'-2)+" =044"-(b+e)=0" (6x0) Thus a'-x=a'-y Now, x=1-x=(a4a')-x ® =(a-x)+(a'-x)=(a-y)+ (0-3) by () ene 2(ata’)-yatey pee So, (a+d)se=a+(b+e) a gio i) Similar (Follow by principle of duality from (i) ) The sorem 5. (Uniqueness of Complement) let me be any element in a Boolean Algebra (B, +, and a-x=0 then xis complement of a Scanned with CamScanner- ENGINEERING MATHEMAnigg | 8 | Proof, The complement of d+ giaats0zats (ars) by hypothesis =(a'+a)-(a'+3) bY distributive law eb(a'ex)=a'te ~ (a-a')=(<+a)-(x+a') =a’ +x by commutative law and x=x 40234 al(xta)=sea From (1) and (2) we have x=a" i.e, + is complement ofq (nvolution Law) ‘Theorem 6. 20.1), (a’) =a for each sien | Ina Boolean Algebra (B, +. a'+a=l, a'-a=0 by commutative law “by uniqueness of complement a=(a') . ain B. Proof, Now, a+a'=l, a-a'=0 Theorem 7. In a Boolean Algebra (B,+',0,1) @o-1 @r=o Proof By boundedness law 0+1=1 1 is unit element plement ol We have also 0-1=0 So, by uniqueness of complement 1 is the com ie. 1-0". By law of duality 0 =" (or, pose an independent proo!) ‘Theorem 8. (De Morgan's Law) In a Boolean Algebra (B,+,-,',0, 1) @ (a+b) =a'-b' Gi) (ab) =a" +b! Proof. (i) We shall prove that (a+5)+(a'-b))=1 and (a+)-(a'-b')=0 4155 b)+(a'-b') = Now, (4+ pa 1)=(0+a)+(a'-b) by commutative law ab+(a+a'-b') by Associative law (which is sh " " 2b+((a+")-(a+5')) by distributive law = a+ (I-(4+b))=b+(a4b)=b5 (5 40) 2(o+b)+a=1+a=1 And (2+5)-(a'-b')=((a+0)-0')-. Since Associative law hold , . in Boolean Algebr: =((a-a')+(6-2’))-6" by distributive law ws =(0+(6-a'))-8" = (b-a')-b' =(a'-b)-b'=a"-(6-b') 2 a.ga0. ‘Thus (a+6)+(a'-b')=1 and (a+8)-(e7-¥")=0 So, by uniqueness of complement (a+b) =a'-5 (i) Left to reader as exercise. Theorem 9. In a Boolean Algebra (8,+,",0,1) i four results are equivalent : eee eae @ atb=b @) a-b=a @ a'+b=1 @) a-b'=0 Proof. I. Let (1) be true. So, a-b=a-(a+6)=(a-a)+(a-8)=2+(a-8) by Idempotent Law b=atb =a by Absorption law in Boolean Algebra. ‘Thus (2) is true. Il. Let (2) be true. . a-b=a (a-b) =a": a’+b'=a’ by D’ Morgans Law OF, a’ 4b'4b=a'sb or, g’+i=a'+b by complement Law or, 1=a'+ by Boundedness Law 4’ 461, Proving (3). Scanned with CamScanner4-156 ENGINER INS DASHEMATICg TIL. Let (3) hold. -. a’+5= 1 (a +6) =1 or, (a') or, a-b' =0 by Theorem 7. This proves (4) =1'by D’ Morgans IV. Suppose (4) is true, Establish (1). Mhis is tte gy exercise. Illustrative Example. Ex. 1. Let (B,4,>') be @ Boolean Algebra and abc eB. Pry, that if atb=a+e and a-b=a-c then b=c. satbzate +. (atb)-b=(a+e)-b or, a-b+b-b=a-bte-b or, a-b+b=a-b+c-b by Idempotent Law or, b=a-c+b-e by Absorption law and by hypothesis, or, baa-ctb-c of, b=(a+b)-¢ or, b=(a+c)-c by hypothesis b=a-ct+e-c=a-c+e=c. Hence b=c. Ex. 2. Ina Boolean Algebra (B,+,+',0,1) if x, y, 2 belong toB simplify the expression (x+y)(x+z)(x'y’) « (x+y)(xtz)\x'y') =(e+ )le+2 (ey) ) by DMorguns Le =(x+yl(x+z)xt y)=(x+y)(e+y)(e+2) =(x+y)(x+z) by Idempotent Law surtaztyx+)z=x+a2+yx+yz by Idempotent Law =x+ yx+ yz by Absorption Law =x+yz by Absorption Law, which is the simplified fo Note. Though it looks simple we do not know whether " be simplified more. This answer is obtained in. oot yooLEAN__ALGEBRRA 7.3. Boolean Ring {A Ring (Rss) with unit element is g gia for all ain ( ois defined as g-¢ pxample. The set B=(01) ig q alled Bollean Ring if ) Boolean Ring w.r.t the campositons + 88d «and defined in he fallowinn ts le: ilo Tq nt py eal He dda v= From the composition table we catisfied by B. So Bis a Ring with Moreover, I’ =1-1=1 by table and ‘0° =0-0=0 by table So the set B is a Bollean Ring. 4.5.4. Relation with Bollean Algebra and Bollean Ring, Theorem1. (Boolean algebra is made into Bollean Ring) In a Boolean algebra (B,+;,'.0,1) we defined 2@b =(a-b') +(a'-8) and a@b=a-b. Then (8,9,0) isa Boolean Ring. Proof : We shall first show (86,0) is a Ring with unit element. LLet a,b,c B be arbitrary. ( Since B is Boolean algebra so the complements a! and b are in B. Again since the coomposition - is a binary relation so 4-8 and.a’-b belong to B. So a-b'+a'-beB as + is a binary elation on B. Thus a@beB. Gi) a® Oc) =aO((b-c')+0'-0) a((b-c') +(b'-0)) +a'-((b-€)+0-0) [by definition of @] =a(6'+(e9)-(WY ee} 4a-(b-e) #09) (using D’Morgass law) See all the axioms of Ring are unit element which is 1 Scanned with CamScanner4-158 ATIC =a-((b'+c)-(b+e))) +a'-(b-c' +B'-e) =a-(b-b+b'-c' te-b+e-c)+a'-b-c!+a'-Bic (using Distributive prop, =a-(04+d-c'+0:b+0)ta'-b-c'ta'-bc tty) =a.(b'-c'+e-b)+a'-b-c' +a'b'-c sabe ta-c-b+a'-bec'+a'-bic a@®(b@c)=a-b-c+a-b'-c'+a'-b-c'+a' bie Again (a@b)@c =c®(a®b) =c-abtc-a'b'+c'-a-b'4c'-a'-b using (1) =a-b-c+a-b'-c'+a'-bic'ta'-bi-c From 1 and (2) we get a®(b®c)=(a®b)@c Gil) We see a@0=a-0'+a'-O by definition of @ =a-1+0 =a “. 0 is null element / zero element in B. (iv) We see a@a=a-a'+a'-a by definition of © 0+0=0 .. Additive inverse of ais a itself. (v) Now by definition of @ , a®b=a-b'+a'-b and b®a=b-a'+b!.a =a'-b+a-b' using commutative property: These imply a@b=b@a Thus Bis ablian group under the composition © (using commutative prop, » tl (using commutative proper) OLEAN _ALGEBRRA wf 4159 Il. Let bce be arbitrary. By ag @ a0b=a-beB ~ the composition (i) 206O9=a-6-0) 2(a-b)-c by Associative law of . inition of isa binary relation =(aOb)Oc according to definition of g UL Let a,b,ceB be arbitrary, @ 40(0De)=a-(-c +06) by definition of ant =a-(6-0)+4-(W-c) by distributive property za-b-c'ta-bi-c ® Again (404) ®(a0c) =(a-)®(a-c) by definition of @ =(a-b)-(a-0)' +(a-b)'-(a-c) =(a:b)-(al +0')+(a'+B')-(a-c) by D Morgan's law =(a-b)-a' + (a-d)+c'+a'-(a-c)+b'-(a-c) by distributive law =b(a-a')+a-b-c'+(d-a)-c+a-b-c =b0+a-bc'+0-c+a-biec Fa-bec't+a-blc “ From (3) and (4) we get 49 (b Gc) =(a@b)B (aoe) © () ©@c)Oa=(80)-0 =a-(b®c) by commutilative property of - =aO(b@e) =(4@b)®(aOc) using (6) © ‘Thus all the axioms of Ring are satisfied the compositive © ‘nd © in B, So (B, , ©) is a Ring. Scanned with CamScannertamale $$ _S Neg, Next we see for arbitrary element a in B, 201 (Lis the unit element in the Boolean Algebra) =a-l by definition of © =a ‘Thus the ring (B, ®, ©) has unit element. Again, for arbitrary ain B, @=aQa=a-a =a by Idempotent law in Boolean Algebra. So (B, ®, ©) is a Boolean Ring Theorem 2. if (R,+, -) is a Boolean ring prove that @ a+a=0 VaeR ie. each element of R is its own additive inverse (i) a+b=0>a=5 (iii) Ris commutative ring. @) aeR=ataeR = (a+a)’ =a+a, by the given condition =(a+a)-(a+a)=a+a = (a+a)-a+(a+a)-a=a+a, using distributive law 2 (0 +0°)+(@ +0*)= ata [ra-a=a’] = (a+a)+(a+a)=(a+a)+0 [: a+0=a] =ata=0, (by left cancellation law for addition in ) (i) Now atb=0 =>atb=ata [by @] = b=a (by left cancellation law) (iii) We have, (a+b) =a+b = (a+b)-(a+b)=a+b = (a+b)-a+(a+b)-b= a+b (by distributive law) labs 7 2 4-161 2 Bb atAO+E 045 Oy aig, eS (246-4) +(4-b+8)=asb ¢y i 2 (a+8)+(b-a+a-b)=(as5)49 aseociative property ibutive law) + Usi Sing commutative and 2 b-ata-b=0, by left cancellation law = a-b=b-a by (i) _, Risa commutative ring, mheorem 3. (Boolean Ring is made into 8 A Boolean Ring (R, +,-) is a Boolean Algeby the compositions v, and , defined by avb=atb+a-banb=a. cement in R. Proof. By axioms of Ring a+b,a-bardi+aeR and so avb and a/b and a’ all belong to R for all element a in R. So the compositions v and » are binary operations and the composition ‘isuniary composition on R. Let us verify the axioms of Boolean Algebra: 1, For alla, bin RR foolean Algebra), ra with respect to @=l+a where 1 is the unit @ avb =atbt+a-b =b+a+tb-a [-; +and - are commutative] =bva (i) anb =a-5 = bea [+> «is commutative] 2. For all elements a, 6,cin R WD anbvc)=an(b+e+b-c) Sa(b4+e4d.0) = (0) (asc)-+a-(b-c) [by distributive law of over+] (1) Scanned with CamScannerzy ‘Again (aab)v (anc) 7 =(a-b)v(a-¢) by definition of » | =(a-b)+(a-c)+(a-b):(a-e) | =(a-b)+(a-0)+((a-b)-a)-¢ [e+ is Associative] = (a-8)+(a-c)+(a-(a-b))-¢ [+ 8 commutative] =(a-b)+(a-c) +(a" bye =(a-b)+(a-c)+(a-b)-c [7 R Boolean Ring] = (a:b) +(a-0)+a-(b-) From (1) and (2) we have an(bvc)=(anb)v (anc) Gi) av(bac=anb-c) =a+(b-c)+a-(b-c) 4 and (av b) (ave) =(av8)-(avc) by definition of , =(a+b+a-b):(a+c+a-c) by definition of v =a-ata-c+a-(a-c)+b-a+b-c+b-(a-c)+(a-b)-a+(aijc +(a-b)-(0r) [using distributive prope aa +acct+a?c+b-a+b-c+b-(a-c)+b-a? +(a-b)-c +(e) sata-cta-ctb-atb-c+b-(ac)+b-a+(a-b-0)+b-(ad) [-+ Bis Boolean Bel =a+0+(b-c)+(b-a+b-a)+(b-(a-c) +b-(a-c)) +(a-b-o) [-a+a=0 ina Boolean Ring] =a+0+0+(b-c)+(a-b-c) =a+(b-c)+a-(b-c) By (3) and (4) we have ENGINEERING MATHEy, al av(bac)=(avb)a(ave) opEAN _ALGEBRRA { We see for the null element zero, av0=at0+a0 “ lement 0 in R, 4-0=0 in Ring] O is null element ,avo=a {i For the unit element 1 in R, aal=arl= 4. () We see ava'=ata'sa.d =a+(1+a)+a-(1+a) by definition of a alt (ata)talta-a =14+0+a+a ~: Ris Boolean Ring =1+0 (-:a+a=0 in Boolean Ring] =l (i) ana’ =an+a)=a-(140) =(a-l)+(a-a)=a+a =a+a [-: Ris Boolean Ring) =0 [by the previous theorem] ‘Thus all the axious of Boolean Algebra are satisfied. So (R,v,A,1,0) is a Boolean Algebra. Ex. In a Boolean Ring (R, +.) prove that (a +b =a + 2ab +O (@b=a-b). Solution, a? +2ab+b? =a' +ab+ ab+b° = a(a+-b)+(a+8)b by distributive proprety =a(a+b)+b(a+6) »; R iscommulative Ring =(a+b)(a+b)=(a+by Scanned with CamScanner4-164 ee EMA, Cg 4.5.4. Boolean Function. Boolean Expression. Let (B,+,,,',0:1) be a Boolean Algebra. Let x,,x,, variables on B, ic. they take values from B. An expreaigntt up from these x, using the operations +, and ' ig can Boolean Expression. For example £=('y +297) +(e) Boolean expression of 942 which are variables on p yp operation (-) is kept understood. Stet Boolean Function. Let (8,+,,',0,1) be a Boolean Algebra. A mapping . jx is called a Boolean function of n number of variables, Illustration. Consider the Boolean Algebra B ={0,1} as cited in an eg example. > Let /(s,y)=2'y +y where x,y are variables on B, Then thy is a Boolean function of two variables. If x=0,y=1 then /(0,1)=0'1+1=11+1=1+1=1 ete, Note. The value of a Boolean function of some variable iss | Boolean expression. 4.5.5. Simplification of a Boolean Expression Literal. A single variable or its complement is called a literal. Fa | example 3,.',y, y" are literal of x; y etc. Conjunctive Normal Form (Product of Sum) A Boolean expression E is said to be in conjunctive nora! form (CNF) of r variables x, x,,-, x, if the expression, Eean® | expressed as E=£,E)---E, where each £,=sum of 2 fin | number of literals of each of xy,rpy~sty and £) #2) fot distinct i, j Illustration, @) E=(e'sz4yx'ty'se rey) io a CNP OM variables x, y and z, OLEAN _ALGEBRRA e 4-165 were B=x +249, Ex=x' sy yay p haa’ sy' ee Be put B=(*' +2)(e' +9 +2(x4 yay ; is : ;, does not contain the literal of )enot sows the expen “o aa nae oa +x is not a CNP. xpress the Boolea : (s+ 9+ e942) = (+942) foyyeeryy eeryt {le ty) (e)+2)} a (et yt) (ety) (+2) oleryt2){(e +y')+0}{(c+2) +0} a(etyte){(e'+y'422/)(c42"+ 94} alee yt {le ty" tl lerty'se) (ers ey) (e42ey)} by distributive law (iv) Express the Boolean function (x'+y’{x+,)in CNFin the variables x, y andz (ety Yaty) =f ty)+2Yesy) +2} =(x'+y'+2)(x' +y'+2)etytslxeyte)) by distributive law (v) Express ab+a’b' in CNFof the variables a, b ab + a'b' = (ab-+a'){ab+6') [By distributive law =(a' +ab)(0' + ab) = (a +a)(a‘ +b) (b'+a)(6"+8) : =I(a’ +5) (6"+a)l=(al +6)(6' +a) whichis the required CNF. Fundamental Product. : literals in which no two A literal or product of two or mor literals involve the same variable is called ‘Fundamental Product. all fundamental product. But For example z'x,.1'75)" ar ‘y's and yayz are not fundamental product. Scanned with CamScannerNC ATU 2h 166 “EE Minterm. a 'A Fundamental Product which involves all variables a Minterm, For example, for these variables x, y, ‘rye isa minterm but sy" is not a minterm, icq the prt Inclusion Let P and @ be two fundamental products. P is saig y, contained in or included in Qf every literal of Pis alsg atigt of @. For example *’z is contained in x'yz but x'2 is Ot contain in xy’z. ‘Theorem. If a fundamental product Pis contained in anothy fundamental product @ then P+Q=P. Proof. Since P is contained in Q we can express Q~=p.p where A is another product. Then P+Q=P+P-R =P by Absorption law. Illustration. (x2! +2'yx=22' +2z'y by commutative property =(2')+(2' p=" Gi) ayz'yx is not a fundamental product. But it canbe expressed into a fundamental product as follow : 22x =ayye'x=292' (by idempotent law) which is a fundamental product. Note that it is a miner also. Sum-of-Product (Disjunctive Normal Form) A fundamental product or the sum of two or mt te ined i ad fundamental products none of which is contained in anothe called a Sum-of-Product, Illustration. (i) E=x2'+y'xz+x'y' is a Sum-of-Product i.e. DNF (i) Ey=y2'+2y'z+2'xy is not a Sum-of-Product si0" fundamental product yz’ is contained in z'xy =)2"* + we can express Ey = yz! + yz'x + xy'z = yz! +xy"2- th of cou® olean Expression e. a 6. into a Sum-of-Product form. This Bato (+2) 0" 429) ={con +} fo" .o%42 ‘Y) removing complement ={(o) HOY? +079} “lol o{(e+ 2 +)} ("+92} using distributive property where ever possible = (ay tae! + 2yt2'2\(x2! + 2) <9! tage tote 422 saya! + xayy taxz'z! + yar! = xy2! txzy tx! + yO) axe! Haye az! +0 sane +2) 420! say +2! = xy +22’, which is a Sum-of Product, . (WBU-T 2007 Complete Sum-of-Product (Full Disjunctive Normal Form) and Min-term Let E be a Boolean Expression of n variables x,,x;,--+,%,. If Eis a Sum-of-Product where each product P involves all the n- variables then E is called a Complete- Sum-of-Product. ‘Thus every product in a complete Sum-of-Product is Min-term. For example E(x, y,2)=ay'z+yer+x2' isa Complete Sum-of- Product of the three variables x, y and z. Here xy'z, y= are minterms of E. Theorem, Every non-zero Boolean expression can be “xptessed as a complete Sum-of-Produet uniquely. Proof. Beyond the scope of the text. Mustrative Examples : Ex 1, Express the Boolean expression 2(x))' in a complete Sum-of:Product form. Note that the given expression is not a Sum-of Product. BM g9 Scanned with CamScanner4-168 Now, 2(x'y)' =2((7') +y')=200 +9) 1 =2r+sy', this is not a comple sum sorts)", this mee ae rete be io dug ealtzy'l aaly+y)ter'e +2) enytay' ty'stay'x! saytay'xtzy'xt zyx! say tay'r+9)x' whichisacompleteSumet Pg Ex. 2. Express E=y'+2(x'+y) as a Full disjunctive ory form. E=yltze' tzyay'llezr'l+ayl=y'(xt2x'(z+2')+ ay y')+afrey) | sayz tay'ztay'2 txt xty'ztxy'2' Ex. 3. If A, B, Care subsets of the set S then express (4° ua (BOC) as union of intersection. Since the set of all subsets of Sis Boolean Algebra under tie operation + = U. and - = © so we use all the propertiess! Boolean Algebra in this expression. | For convenience we replace Uby + and © by . and 4° by 4 fu yk =(4'+0)-(B-O! ={(AY-C}{B+C) (fu¢} nlengy =4'+9-B-0'=(4 Mt rs) =(A-C’))-(B'+C))= A-Bi+ A-C'4C'- BHCC = ACC! BI + ACC ACI B+ A-C! =(4ncnB’) u(anc’) Ex. 4, Reduce the expression E=xy+x'z'+*y'+? simplified form. We express each product into a complete Sum-of- ay 22+ 2') = 392 bay x! ax'2'(y+y!)=a'dy ta'2'y! ty 100 product! | pOOLEAN ALGEBRA xy =xV (E+) =xy 24 xy Ty PHESH) Spe aye We see the summands of xe" are yn appear among the summands of yang rn *29" Which Gowe delete x's" and get respectively, So (1) is the required minimal form ofthe Boo A le Bx. 5. Simplify the Boolean expression x'y(y+2)+y2(y" x!) an expression, ; ‘Wy +2)+ yay +x’) SAY 42+ yoy 4 yc axy tx t20tx =x sxh2 ery 40 =x'y+x'yz=x'y (by absorption law) Bx. 6. Express the expression xyz+.x'y'+2'ys2y2' into the simplified form. xlyetxty't! +x'y-tay'2! axyetx'ytx'y'2!tay'2! =x'y+(x'+x)y'2" (by absorption and distributive law) Sx'y+ly'z!=x'yty'z! Note. In the last article of this chapter we shall show another Process called KARNAUGH MAP process to find the minimal expression of a Boolean function. 4.5.6. Truth Table of a Boolean Function Let B ={0,1} be a Boolean Algebra w.r.t the operations +, . and' defined as + 1 0 . 1 0 rfaoiqd 1{1 0 v=o oli oo o}o .0 o=1 artier we have shown Bis a Boolean Algebra).” Scanned with CamScannerSee eed 4-170 = ICS yy Lot /(xiesgy~44) be a Boolean function of the n varigy ety kn : Xi Rzav ty €B={0, I}. ‘The table which shows all the possible values attaineg ty, corresponding to all possible values taken by the variahy, z es iy | known as Truth Table of the Boolean function /. | Illustration. “ (@ Let f(x,y)=2'+y' bea Boolean function on 8 (9 ) ‘Then the truth table of fis We write T(f)=1110 OR (0011, 0101) =1110. Gi) Construct the truth table of the Boolean function | S(z.y%.z)= (2 +22') Cy" +2)'- First we find the minimal expression of f(x, y,2)- P(e, 9.2)= (2 +22’) {Cy} =(ztx/(x +92!) =e +32/)((x"+ 92) | =(y2+22')(x'2' +2’) yee’! + ype! 40'x''+a2'y2' (This is not Sum-of-Produel = yx'0+ yO-+02! + xy2' = 040404292" = 2’, ‘This is complete sum-of-product and can not b further. e reduc! So, f(x,¥,2)=.2! is the minimal form. pooLPAN ALGEBRRA 4171 its Truth Table is =] »[. T+ . of 0 | tte = EG of of ifo| of 0 PY" 0] 65 a las op a0 Pog ae leer eae ‘i eit \ts0 0 13 1 of of y a1: 1} rf afo} fe 1 1 0 1 1 it We write 7(f) = 00000001 or,, 7'=(00001111,1010001, 11001010) = oo000001 (iii) Using Truth table show that 5’ +ay+xyexsy Let the variable x, y take values on the Boolean Algebra {0,1} w.r.t the binary operation as mentioned earlier. If the ‘Truth table of the two Boolean functions on LHS and RHS are same then we can claim the two sides are equal : ‘Truth Table of (++) * x" xy [tay [a tayray| 1jo}o of. 1 1jijlo of. 1 ofo}i1 o} o 0 ofita 1 | 0 1 Scanned with CamScanner4-172 NS eee CS, we see the Truth table of the two functions are same, Solves Ue ae Z prove tat the sto divisors ot Construction of Boolean function from Truth Table 66 (ii) 20 Boolean algebr: 7 This is shown by the following example : * peration toe intadued by Construct the Boolean function and simplify it given following table: the | 4g, Dio= set of divisors of 110, Show its diagram as a Book oolean | glgebra. prove that the power set ofa set $j rfa]fa a Moperation nandu, Sisa Boolean Algebra want 7 0 t a Boole o 1 5, Construct a Boolean Algebra with only wo elements ie \n0 1 §, Prove that in a Boolean Algebra (B, y, ,) d tye yo ee » a) avanoan o fact et z.1n a Boolean Algebra (B,4.'01) prove that a+ i= 5 acl a dual of this relation tial. Write the |g, Prove that in a Boolean Algebra the two unit elements viz 0 0 0 1 and 1 are unique. 0 0 0 9, State and prove the ‘Absorption law’ in a Boolean Algebra or, 7(11 10000, 11001100, 10101010) = 01100110. 10, State D' Morgans law in a Boolean Algebra. Prove one of the two. ts val t 2nd, 3rd, and Gth, 7th row. The f gets values. 1.at 2nd, ed, an » Tth row. The tems | 11, In a Boolean algebra under + and, prove that corresponding to these rows are xy2',xy'2,x'y2" and x) respectively. The terms corresponding to other rows are 0. So the Boolean expression is @ a'tb=1=>a+b=b- i) a.b' <0 a+b=b 12. Define fundamental product and min-term| of three variables xyz! tay'z+x'ye' tx'y'z | ina Boolean algebra, Give an example ofa fundamental product e(cteele(cbe')y'e=dyettly'z = y2' 47 which is not a min-term Which is a simplified form. | 18.1n a Boolean Algebra prove that the required Booiea Rinstzhie’Fens=s2't7? FO Bucaceact on asrci(cea)brd) Exersice | Gi) (x+y). (rot y) =p Gv) ap tape try IE 'pb'd) (e+ ab+bd) I. Short Answer Questions ©) asec rai)+ (pelt =(c' tab +2 a . 1. Prove that the set of divisors of 70 is a Boolean gob Wi) (F4 gyheghf'=W" the binary operation + and . and unary operation » (vin (a+b+0)-(abey ab! 4b-e te" a+b=lem of a,b, and a-b=HCF a, band a’=70/4- Scanned with CamScanner4-174 14, Write the dual of the following relations in Boology 4) Gi) (:1)-(O+a')=0 (iv) (a+d)(b+e)=ac+b (vi) x'z +09 +92) (viii) (a+8)-(a+1)=a+a-b45 eh, @) ata'-b=atb (ii) (a+(a+0)=2 () xy": (vii) (yz + y's" (ix) 4-B'=0 iff A-B=A [Hint : Replace + by result] 415. By applying D'Morgans's law find the complement of @ (e+) (i) A+B) Gil) (vw). (iv) y'z+x" (w) (4+B)-(4'+8) 16. Find the complement of the expression xy’ +xz+y'z. 17. Simplify the following Boolean expression (Just by usiy properties of Boolean Algebra) @ (e+) (+2) +292 Gi) a'be-+a'be! + abe! +abe Gi (x+y) (y+2/)(y' +2) (*'+2) Gv) y’x! + y'x + yx (W.BUST. 2007] (v) a’ +(ab" +ac)! (vi) xy tay t2'y (wii) C(B+C) (A+ B+) (viii) A+ B(B+A)+(B+A')A (ix) x+2'y2' + (942)! @) x[y+20y+2)] (xi) (4B'+C)-(A+ BIC (xii) x'y2! + ay2! + ay'2! +2'y'2!. 18. Express the set expression (4U.B)° n(C° V3) ® intersection with the help of the Boolean Algebra. . by +, 0 by 1 and Ty O and ge | ' ) as anion yeAN ALGEBRRA “p.for any Boolean Algebra B,Provy thy @ (a+ dXo+ Ne +4)= b+ be+.ca for all a, b, , aint: LHS = (ab+ ac +b. a *heNe+a)= (ab +ac+b-+bele+a) sabe + ab+ 00+ 00+ be+ba+be+ abe = ee abe + ab+ be+ca ab is contained in abe)] (WB.U.r2009 tyes ysatfa's yee) (W.B.U. 7. 2002, 2005) Gin (ety) +2)0+2)=224274 ye= (es ye +2) 20. Express the following expression in CNF in the variables present in the expression : @ az’) +x" Gi) ("+ b)e+(a+0)(a’ +c’) Gv) (@'+b)+(a" +8)" (vi) (a +'Ya+Bfa+e) 21, Reduce the following expression to either Oor a fundamental product, Are the reduced form Min term? @ xyz'y'sts (wi) ty 22, Reduce the following expression nto (Sum-of-Product) and then to complete sum of product. Gi) xy +49) Go) G+) (i) Ox V(0"+07) @ yetx Gi (+2) +3] +9 +2) 6) x+G2+ay'Y © (of +y'z42y) Gai) (y+ x'y +p" () (px + pte + y's) (il) ayx$ +35 (Willy. (ey Yor eter +) x) {Qy7'2] +3) (W.B.U. Tech 2005) [ W.B.U. Tech 2006] Scanned with CamScannerae ENGINEDRING MATHEMA Ti 23. Find the disjunctive normal form (Sum-of-Produety = Ey Boolean expression ~Ghow thatthe set $= (0) (gy 4 1. ise Boolean Ri 0 slmeasyys)=var #8 Hay eae defined bY (al+H=(as4 Posen Ring with espe Gi) (vt y+ s)or ty" (WB.U. Tech » ‘ {a]-(}=(0b] where 2g le 24, Transform the following CNF into DNF : @ (v+r ots) Gi) (x +y' #290" $27 +2)" +) +2) (xty'tz\(x+y" +2\lxty, F gg. Test whether the Power set of non nul ing w-roehe compositions Us and gmp, s [Hint : In fact this is not « Ring at al Ina Boolean Ring prove that every coments its own inverse set S is a Boolean lement), ‘ 25, Find the complements of the following Boolean functig, | 5% x etion | ‘nder addition +. @ xyst easton’ tye, GH zt {Hint : Follows from a theorem) (ii) a(y"2" +92) (iv) ab’ +ac+b'e | werd 26. Find 7(/), the truth table of the following Boolean func, ae ue @ Sesz)=xye+02" Gi) fayette (il) SaxQexy |S 10 5s 27. Find the Boolean function from the following Truth Tate: | @ (00001111, 00110011, 01010101) = 00101111 | 2 un Gi) 7(00001111, 001 10011, 01010101) = 10100110 | . 1 (11110000, 11001100, 10101010) = 11110010 | a0=0 28. Using Truth table show that (x+y)-(x+z)=* +(y-2). 4. () a-(a'+b)=a-b Gi) (0+0)+(-a')=1 [Hint : Show that Truth Value of LHS and RHS aresame) i) a-0+a-1=a Gv) ab=te=(a+e 29, Using truth table verify ©) (x'ty'e2)(eeyse) OD @s)fetys90"42} ( idempotent law (ii) D'Morgan’s law (iii) x(x+y)@+9)" | (ii) (y+2)(y'+z)+x (Vill) abra0=a-(a+8)-b (iv) xy +z+(x' +y)2"=1 (v) yztx'ye'+ayay (ix) A4B'=1 iff A+B=4 30. Find the Boolean expression in CNF from the following'™ 15.0) xy" Gi) cry ae (iid et" table: fv) x(y+z') () 4.B+ ABs a8" 18 G4 y).42.042) 12) ways Gi) b Gi) xy'2) @) VF (ii) C (iti) 44.8 (ix) xt2 OF (Batag ac. y' (ated (oi) #4 fai) C+ BC (i = Scanned with CamScanner“178 ENGINEERING NATHAN, 20. (i) (x ytz\ox! ty te )(e" 4)" +2) Gi) (atd+0)(a+b' +oa' +b" +c’) (vty te)lrty" tert ytalaley tz’) (iv) (a+ba+b')(a' +8)(a' +b’) () (wey tela ty tee ty'+2) (vi) (a'+8'+ cat b+e) (a+b+c')a+b' +c) 21. ()0 (i) 0 22. (i) ay'2! +ay"2 Gi) yz tage! bay's tay"?! (iv) a4" =H NP" Lay () xy" + ay'z = 2y'2! +ay"2 (i) aye! +x'y!= a2! +x'y'2 4x"! (i) xyetx 2! tay'rty's (vi) apres tapes ryan than tains) | (viii) xy’ ix) ay +2" : | 23.) w'ztay'z+xy'ztxy2 GH) ptt tx | 24, () x'y' by, Gi) x'y'z' +22 | 25. (i) x'y'z+-x'yz' +2y'2' +292" (ii) x'y' ty ii) x’ +(y +2)(y' +2’) (iv) (a +bYate)(b+e) 26. (i) 00001010 i) 00110101 iii) 1000 il) 2+ (+2) 21.) ty, (ii)ye' x2! +2y'2, 30. (x'+yx+y') 82. n0. IL. Long Question Answers ve 1. Prove that the set of divisors of m is a Boolean Ane i respect to the composition +, . and', where a+b=10N" rot 0), a-b=HCF of (a, b) and a'=™, where mis a PO" distinct prime integers. ‘ [Hint : Show the set is bounded, distributive compleme™ 2. Prove that the set of divisors of () 99 are not Boole" Gi) 130 are Boolean algebra (operations to be introdue® 4179 .ess the expression (a+) ‘ple number of variables, end 7(f), the truth table of the followin [QV ADAVAAI + i) Ha y2)=Ger2heleyhye an f72™ eae (W.B.U-7, 2005, 2008} Go fe VI AVF HA fares ys wt aye ta)tye . g, Find the Disjunctive Normal form of the Boolean funetion paving truth table : (2+) (a4) in the smallest i Boolean function : a, 01D] Porc o} of 1] df of} 1] of a o ey 4 q 1 0 0 qy 1 0 1 0) 1 1 0 yj 1 1 1 y 6. Find the Boolean expression in CNF from the following truth table: .e pT TTo fo ]o o}o fa fa of 1 fo }r ofa fa fa 1 0 0 i 1 0 1 1 : 1 0 i 1 1 1 0 {8 7{UTTr0000, 11001100, 1or01010)=11101001 Scanned with CamScannerAnswers 3..ac 4. (i) 01000101 (ii) 10101010 Gi) 00111111 (iv) 10001010 (v) 01000000 (viy lon, 5. gota ty st x yet eye 0 (+ )"*2%het yey II. Multiple Choice Questions 1, Number of operations required in a Boolean Algebra ig (a) 1 (b) 2 ©3 @4 2, Number of Unary operation required in a Boolean Algebni, 1 2 ©3 (a) none 3. In a Boolean Algebra (B,+,;'0,l) if a’ is complement of ath (@ ata’ =lonly (b) a.a’=0only (© ata'=1and aa’=0 (a) none 4. Set of real numbers R is a Boolean Algebra w.r-t the op $1701 erat (@) yes (b) no 5. The set of divisors of 70 is a Boolean Algebra w-r-t the +and. where a+band a.b stand for respectively (a) LCM and HCF of a and b e operat () max (a,5) and min (a,b) (© usual sum and usual product of two numbers (d) none of these. - 4-181 the Boolean Algebra 'set of divisors ; 3 tn mploment oie of 70' w.r.t LOM and @7 1 10 @ none .In the Boolean Algebra (0, w.rt the conventional + and . ile @2 o1 @o @) none g.Jna Boolean Algebra, the dual of the statement (x+).(x'.y’)=0 is (@) (x+y) +(e +y')=0 ©) y)+O'+y)=0 © @»+G'ty)=1 (@) none 9. In a Boolean Algebra (B,+,),x+= (a) 2x 2 (Ox (@ none 10. In a Boolean Algebra (By), xA@V))= (®) x @svy ©o (@ none 11. Ina Boolean Algebra complement of complement of += (@)x (b) complement of = (qd) none (© aunit element 12, Th a Boolean Algebra with th complement of f= ws ©) fry two unit elements ¢ and f we (@ none Scanned with CamScanner4-183 —— CG 48. In a Boolean Algebra (B,+,-,0)> ata'-b= (a) ab (b) ab a (@ a+b 14, Which one of the following is a literal (@) xy ® » © xy" (@) none 15. Which one of the following is a CNF of x,y (@) (ty) +9) ©) G+)" +y) © (ey) ("+92") (@) none 16. Which one of the following is not a CNF of x,y and ; | (ix +y+2) () (ety 424 y43) © (ity tz)(xty' +z")etytz) @ (+ yl +y' +2!) 17. Which one of the following is a fundamental product of the variables x,yand z | (a) xyy (b) + y)Or+2) © xyz @) x»x'z 18, Which one of the following is not a fundamental produ xand y . @ 9 ® »" | ©y @) yy" | . fl 19, Which one of the following is a Min-term of x,221838%4 a Bealgebra (a) mx2%5 () xjxzx5 (©) xjxgx3x4 (@) none ALGEBRRA po0LBAN ich one of the following i nn wing isnot a Min-torm fo @ xy the variables ©) (4294242) (@ sttF @ xyz g1. In a Boolean algebra xy2'4wys'e= (@) xyz" (b) xy?" 4m) © xe'+) (@ none 29, Which one of the following is a DNF variables *,yand z Gum -of product) of the (a) net (b) yetexy's! (©) yt peter @ ytytatns 23, Which one of the following is a complete sum of product of the two variables xandy @) xytax'y (b) xy" © xy'+x'y" @) vxteyx! 24, In a Boolean algebra 3y(x'+y')= f@)1 (b) x Oy @o 25. In a Boolean algebra (+s f@xy mo © Got eex'y (@) none 26. In a Boolean algebra (a+b)'+(a+0)! = @o wa Oe - ‘oa Raa ay Scanned with CamScanner4-184 eee ee 27. Ina Boolean algebra x(x'+y) ++ 0742) = @ = ox © yF @y 28. In a Boolean algebra x+(9.2")= @) x+z . wry (co) x4 (@) x+y+z 29. In a Boolean Algebra (a+b+c)' = @) ati! (b) at tb'ee! (©) a'+(b+ey" (@) none 30. The dual of the expression x'yz’ +x'y’z is (a) xteytzitxtty'tz — (b) (ety t2")@' ty" +2) (©) (xy'z).y2') (a) none $1. The dual of the expression 4B(B+B'C)+ 4'C is (b) 4'B'(B'BC) (@) (A+ B+B(B'+OC)}(A'+O) (a) (A+B)(B'+BC') &) A'BYB'+ BC!) 32. The complement of the expression xy" +x'z is @) ('+y).2" (b) (x42). +9) (©) xty+32" (d) xty'2" 83. a. {complement of (a.b))= @ as ) ab © (aby (@) none 34. The dual of the statement" x=0 iff y=ay'+)*" () yoo itt ce (@) x=0iff y=x'y+y'x (© x=1ilf y=(x+y')(y+x') (a) none poolEAN ALGEBRRA 4-185, 3p. The dual of the statement =0.and y=0 j (@) x=0and y=Oiff sym PRO; x4 ym 0m ig ©) xetand yerith set (@ none of these reduced to the Disjunctive (© x20 and y=Oiff yao 6. The expression’ y(x+ )2")’can be Normal form (Sum-of-Produet) () yx tye ©) xyz © yet @ none 37. Ina Boolean algebra zy:'s= @o 1 @x @z 38, In a Boolean algebra xyz! yr's'= @o ®1 ©x @z 39, In a Boolean algebra )xyz is reduced to the min-term @ xyz ) 2ayz Ox (@ none 40. x2'xy'ty’ can be reduced to the min-term @o & x92 © xyizr @xyzrr 41. The Boolean expression x+z'y can be expressed in Conjunctive Normal form : @) x+y xy Ox (@) x+y 42. The Boolean expression xy’+12#ayean be expressed in Conjunctive Nor al form (a) xey Me 4 ©. @ no Scanned with CamScanner4-186 ENGINEERING MATHEMATICS - Vv —. 43. The Boolean expression xy'+x'y+xzcan be expressed in Disjunctive Normal form (a) xy'ztxyl2’+xyztex'yztxy'z! (b) xy'z+xy'z'+xyztx'yztx'yz" (c) xy'z+x'yz'+xy'z (d) none Answers lc 2a 3.c 4.b 5.a 6.c 7.b 8.c 9.c 10.a lla 12.b 13.d 14.b 15.a 16.d 17.c 18.d 19.c 20.d 21a 22.c 23.b 24.4 25.a 26.c 27.4 28.c 29.a _ 80.b 31d 32.b 33.a 34.c 35.b 36.b 37.2 38.a 39.c 40.d 41.d 42. Scanned with CamScanner