5.2.1, Introduction | Tn the: mid of 1800's, British mathematician “George Boole” introduce: « mathematical Steucture called Booican algebra, De-morgan, Pierie and Jevens developed Boolean algebra with modifications. Boolean Algebra is basically two values, 1¢., (1, 0) tunction. Previously, it had its application to nts and sets which are either true or false, Now-a-days it has wide applications to switching Sircuits which are either on or off, (,, (open or closed). asically, there are (hree operations in the case of Boolean algebra (i) And, (ii) Or and (ii) Not, which are symbolically written as A, V, (+): In sct thcory, these are written us A, U and ', But in this chapter more common symbols (+), (:), (!) are used for the same operations respectively. Notation In Logics in a +, ’ et a ‘ 3h af ion of Boolean Algebra Any non-empty set B with two binary operations, ie, (‘+', for addition,” for multiplication) with i | | Word et eae 8 unary opcration “ ’ ” and two distinct elements J and-41, is called Boolean Algebra |B, +, «, ‘] Provided the operations, satisfy the following axioms, 1. Commutative Idws. ra @atbabta, (i)a-b =b-a, Va,b EB. 2. Associative laws. aa @at+@+ce@th)+e, (il) a: (bc) = (@:b)‘c, Va, b,c EB. 3. Ideutity elements. @at (i)a-1=1-a=0, Vad, For addition ‘0’ is identity and for multiplivativu 1 is identity. _4Distributivelaws, —Wa-+c)=abt+ac, ii) a + (b-c) = (@.+b)-(a +0), Va,b,c EB. Note: In Boolean Algebra, addition is distributive over the multiplication whereas in general algebra itis not so. 5. Complement, For each a € A, there exists a’ & B, such that @ata’=1, (i)a-a' = 0 VaeB, where 0nd 1 are additive and multiplicative identities, respectively. Illustrative Examples v / Nears 1. Let B = {0,1} be the given sct. The elements 0 and 1 being symbols having no relations with the numbers 0 and 1 used in arithmetic, Binary operations are‘ +" and‘ - * which are logicataddition rf Boolean. Algebraa | 5.23 < \ per] @ Scanned with CamScannerVearsets Books \ e gnctmutnptocation, They to SB. : : » folowing tables (i) ard (i Then, the given sot B wth defined binary opera tables belong to B. Hence, the Solution :1. Closure property; All the cate closed with respect 10 the given binary operatine 2, Commutative property + Since there is symmetry about the leading diagonal Therefore, commutativity wr.1. theoperations* +. "and" both hull in OFM T+0et and 0:1 = 1:0 = 0, etc S.Associative property : From the tables, we have (+Q4+1 0141 #1. and 1+ (+1) =1+1 =1 i) f both the tat From (i) and (ii), we conclude that (1+0)+1=1+ (041). Hence, associativity holds w. r. (the operation! +’ Similarly, 1-(0°1) =(4-0)-1 So, associativity also holds wr. t. snultpieaie operation ‘ F 4. Distributive property : Since, ‘ £ 1+ @-1) and (1+0)-(.+1) Hence, by {i) and (ii), we conclude that’ 14 (0-1) +0)-( +1). Therefore,‘ +*is distributive over *-’. Similarly; we can prove that, Hence, the distributive law holds. 9. Existence of additive and multiplicative identities, Sine 2, Wg from 0+0=0 i 1 3 Therefore, 0,1€ B are additive and mul ‘iteative files respectively 6. Complementation property: From the given table (@)0+1=1 ‘ ss os (ii) 0-1 = 0" ee: Therefore, complements of 0.And 1 are 1 and 0 respectively. ' Thus, we find that all the axioms are Satisfied for the dolined opérations on B. Hence, {B, +, Boolean algebra. : ample 2. Sate whether the se’ B © {a;b,¢, yo) with the teaaions defined in the given tables is a olean algebra? ° Scanned with CamScannerootean Algebra | 92% Solution : From table (i), we have at+a=ab+a=bcta=cd+a= Hence, a is true additive identity, also, from the Sth column of the table (ii), we have a-d=a,b-d=b,c-d=candd-d =d ‘Therefore, d is the multiplicative identity. 1. Commutativity property : Corresponding rows and columns from the tables being identical lead to the conclusion that the commutativity holds with respect to both the compositions defined on B. 2. Distributive property : From the tables, we have b+(C-d)=btc=d and (b +c): +d) ~ deb =d. Hence, from the above two results we have btod =b4e)(b4d), Vdc dED Similarly, we can show that _ bet) =betbed 3. Associative property : It can easily be verified from the table that a+(b+e)=(@+b)t+e=d and @-(b-c) = (a'b)"c =a Va,b,c,d EB. Hence, associativity holds w.r. t. both the operations. 4, Complementation property : Since, | OE dandb-c =a, hence ¢ is the complement of b, because d is tlie multiplicative identity and a is the additive identity. Similar results can be shown for all other elements of B. Heuve, every element of B has its complement in B. 5. Closure property : Every entry of the table belongs to B. Therefore, B is closed with respect to the above mentioned operations‘ + and‘, ae B be a set of positive mimbers being divisors of 30 und the operations V, \ on it are ed In the light of above discussions, we conclude that {B, +, -,' } is a Boolean algebra a Wb = where cis L.CM. of a,b and @ b= d, where dis the H.CF-of a,b o Va,bc,d EB, then Bis a Boolean algebra, [R.G.PY., June 2003] Solution : Let the set of division of 30)is B ={ 1,2,3,5,6, 10, 15, 30}. ice, we have as per definitions of the given operations 3v5=1SEB and 3AS5S=1EB because 15 is L.C.M. of 3 and 5 and 1 is their H.C. 1. Closure propert; Scanned with CamScanner1 sr tety Books Similarly, Hence, ” “£48 Show for all ether clementso £8. eee and » the set is closed w, rt the gina? SB, a tivity: Since, °M peratong =5v3 Similar, . ence, tll Can be shown fr other Mths % Hr Of Clements be! aa) 2 Vpn Oclemeats belonging pp s i Cons, aAbe : Seat Cominutaity hots « Ren eee Since, as finitions ae the given operations and + BV Sv Iie BI operations we han Hence, 85) v 10 = 15 v 1 m39, Similarly, we have 3¥6V 19 = v5) vi0, ‘ 3A (SAIS) = Similar results can be A) = BA'5) ats =1, ae obtained for all other elements of and aVb Vc)=@vbyve @A (Ag) = 5 \ Therefore, associativity holds m 1h ope NO) Mo Ves be SD. es Isw.r.t : : 4. Distributivity:: Since, both the given operations 3.V(5A10) =3:V5 =15 and BV 5) 4G v10) = 15 4 30=15, Hence, 3-V (SA10) = (3 v5) A (BY 10) ete. Therefore, we conclude that av (b Ac)=(@Vb) A (ave) and aN (0 Vc)=@Ab)V (a Nc), Va,b,cEB Therefore, the upes ativus obey the distributive law on cach other. 5 Existence of identity elements : (i) Since, avi=lvaea,VacB (ii) a A30=30Aa=a4,V aGB. eke Henice, Lis the identity for the operation ‘V’ and 30 is the identity for the oper Verification. Svi=ivs5=5 and 10.430 = 30 A10 = 10. Similarly, for ali other elements of B. Hence, the ides exist in 3. & Complementation : Since, we get a and b € B such that elements w.rt. both the given operation: (i) aVvb =30, (i)and Hence, the complement of a is b © B. Verification : Let a=5EB then 5v6=30 and 5A6=1 Hence, 6 is the complement of 5. A % Similarly, we can verify that all other elements of B have their complements in B. Hence, {B, V, A,'} is a Boolean algebra. Scanned with CamScannerbra verties (Theorems) O” Boolean Alge ra (8,40) ce wth tv ie is le identity is unig SA, Multiplicative : 5 i peer as Hae {iy roreach € Bits OMP ne ie rool. (i) Let 0 and 0) be two additive id ae O40 = 0 3, Some Prop y Boolean alge For am} and” But, we have: +0 =0+% > 0, =0 ‘Therefore, additive identity s unique im B Similarly, (@) may be proved: GLb and betwo complements ofa & Ben b+0 btae = +a) 040 (240): +0) =10+0 =bte c=c+0 ctad (+.a)-(¢ +) (ate) +e) 1b +0) bte ing, the above two results we find that, bee. Similarly, Compari ‘Therefore, the two complements of a are equal. [R.GP.V» Dee 20 anton ye 2010) 2004, 055 Jum [is additive identity) |. Oris additive identity) (hy commutativity) [0is additive identity in] [2c is complement of a] (distributive law) (by commutativity) [i a’ =banda +a 4 (Lis multiplicative identity) [/: bis complement of a) [v ¢=a'anda+a'=1) ence, the complement of ais unique. So, every element of B has unique complement in it. worn conan crn ee es Proof. (i) a+ omiaiiey-1 = (@+a)-(a+a') =ata;a' \/ =at0e =a, ata=a. Mi aasaat0 =aata-a =a:(ata’) sal Hence, (ii) Repu or- [1istdentity wort") [eata’=1) (by distributive law) [ asa’ =0) (Gis identity w. r.t.¢+°) (@being additive identity) [saa =0) (by distributivity) (reta’=1) Scanned with CamScanner—— ; a - , — { . Lis multiplicative ‘enti, jens aa=a,VaeEB, Micorem 3. Involution law : Vae8,(a')' =a Proof. Let a be any arbitrary element of B, then = 1K)" = (a +a):(a')’ = a-(a’)' +a'-(a’y’ y) . =a(a’y +0 (+ (@')'is complement of a’) =0+a(a'y rt = =a-a'+a-(a’y’ [- = aa’ +(a’)') (by diseibaviy =@1 [va +@y=y =a (1 is multiplicative identity) Therefore, we have @)' =a, .@Qa+1=1VaE8, (ii) 2-0 =0, VaeB. Proof. Let a be any arbitrary element of 8, then @ a+1=1-@+1) [+ Lis multiplicative identity] = (@+a')-(a+1) ‘[-ate’=q =a+(@'-) (by distributiviey) eee) (= a'1=0] - =. : (sate=y |, Hence A, Gi) 0+a-0 (by O being additive identity) a0 =a-a'+a-0 [= @-2' =0) = a-(a’ +0) (by distributivity) — au [ve +0=0) 0, fo e-e'=q 2-0=0. be. 5. Absorption laws : : R.G.PV., Feb. 2008] @2+@b)=a, IRG.Py. em - (ii) a-(a +b)=0,Va,bCB, [R.G.PY,, June 2006; Jan-Feb, 2008; April 2010) Proof : Let a,b be two arbitrary elements of B then, @ atarb =a-ltarb (by 1 being multiplicative identity) =a(1 +b) (by distributivity} 7 =a-(b+1) (by commutativity) se [yb+1=y =a. Hence atab=a, VabeB, (a +b) = (a + 0)-(a +b) |. Ois additive identity) me H1(0ib) (by distributivity) ee oa (by commutativity) mat [ob-0=0,voe a) Scanned with CamScannerRed ons Boolean Algehra | 5.29 Thenrpyes. (90° @atb=q Proot (i) (ies od 4 1--0is additive identity) . i (ata =1) ‘ Dena a x [otis multiplicative identity) sf V=0. Del - Reorem 7. De-Morgan’s laws : em rean’s laws ae Ey +1] be a Boolean algebra and. a, b be any two elements of et PY. June 2002; Dec. 2005; Feb, 2008; Jane 2009; April 2010} ae f (Gaye ars by, Proof. (i) states that (a'-b') is the complementofaag.. eee Therefore, we have to prove that Hs (@ +b) +a°:b* = Land (a +5)-(a'-b') = where 1 is multiplicative and 0 is additive aid te Ba) aia) Now, (2+) +a" b' = [a +b) +0} (a+b) +5) (by distributivity) [2+ @+e'))-a+@ +d") (by associativity) [a 4 (a' + b)]-[a + (b +b") (by commutativity) [(@ #4") +b)-[a+ +0") (by associativity) = (145)-(@+1) [v ata’ =1b+8'=1] =Pi=1 — (vati=ib+1=3] Therefore, Gb) talib = 1. 2) Also, (a +b)-(a'-b (a'-b') + b-(a'b') (by distributivity) ; = (a-a')-b' + (b-b')-a" (by commutativity and associativity) Ob! + 0-0" [oa =0=b-b') bi0+a'-0 (by commutativity) o+0 [a0 =0cte] [/:0is additive identity] Q ff EN oa Consequently, e Hence, \de that (a'.b" By (1) and (2), we conclude that a + bt is the ai) In this part, we have to prove that a Teton iy (By complem i the eumpleament uf (a ++) .¢ complement of (2°b). entation laws) ‘Therefore, we have to pes As one 1 z (ab) (@' +5) rapier sen) Cvs and ty + (a +b) = [a + 4?) 1) +a! Now, (Co) a fara) torte en i so) (68 gies ivi) s(t) ate) aon at) by comnutat (by commut Scanned with CamScanner=11 [ray =1 = Therefore, (a:b) +a" +b") = 1 and (@°d)-(a' 4b") = (a:b):a' 4 (a-b)-b" = a(h-a') +a: (bb) = (a:b) + a-(b-b') = (@0')-b +a(bb') =0b +00 [ =b0+a0 o+0 f ®, Vaeny 0. (O being additive identity) Thus, (2.b).(a' +b’) = 0, 2) By (1) and (2), we conclude that a’ + b' is the complement of a-b, consequently, (aby = a' +0’, aan Illustrative Examples pimple 1. Let [B, +, -, "| bea Booleansalgebra anda, b & B, then show that : vH_.2+@+b)=045, iP a-(@-b) =a-b, ab a:b! = 0, [RGPY,, April2009} (iv) ab Patb=b, ©) a+b=b=a-b=a, Wi) ata’ Gil) a tab=a'sd.” IRGPI , April 2009) Solution : (i) a+ (atb)=(a+a)+h ‘a (by associativity) =ato. (oata=a) Hence, at@+b)=a45, (ii) @-(a-b) = (a-a)-b (by associativity) ob (by idempotent law) = @(a-b) ~ ab (iii) ab! = (a-b)b [> ab =a; given} = a-(b-b') (by associativity) =a0 [be =O, fy au=g Hence, ab=a > a:b’ =0, (iv) at+b=(a+b)-1 [1 is multiplicative identity) = (a@+b)-(b +b’) [vb+b'=1) = +a): +d') (by commutativity) =b+(a-b') (by distributivity) eo (given that a-b" = 0) [/- Dis additive identity] [) a+b =b, given} (by distributivity) 4 5.30 | Variety Books ay » Sy » Scanned with CamScanner=atab =a. Therefore, Babee i sbewb-a “ athe enya = (+) a') = a+ (ba'y - “24a! Hence, we have "at atad math, (vii) a tab = (a +a)-(a' 4b) (a +a')-(u' +b) =1-(a' +b) =a'+b. a+ab =a’ +b, Hepce, Users 2. In a Boolean algebra (B, +, -,'), prove that : Hi @ +0)" +b): +(a+d'y =a’, (@' +0) =a'-b+arc, Solution : (i) By De-Morgan’s law, (ab)! =a! +b’, we have (a+b) + (a +b’) =[(a +b)-(a+ by) =(a+b-b')’ = (a +0) =(a)' =a’. Hence, we get @ ‘Thus, we get (a+b) +(@+b’)' =a, Boolean Alvcora | 5.31 (by idempotent law, re,,a-a = a) (by absorption law,a + a-b = a) {Lis multiplicative identity) latany (by distributiviyy (by commutativity) Proved. (by disteibutivity) (by commutativity) (cata = [/1 is multiplicative identity} Proved. [R-GPY., Dee. 2002] [R.G.P-V., Dec. 2002, 06] (by distributivity) [-b-b =) [veto Proved. LHS. = (a +)-(a" +c) = ur(a' +0) +-(a’ 4 c) (by distributivity) = (aa! tac) | (b-a' + bc) (by distributivity) = (Ot arc) + ba tbc = (ac +0) tb-a' tbc = gic bra’ + bec sac + ba’ + beh = ac +ba' + be(ata') = ac + ba’ + be-a + bora’ ac + bera +a'b + a'be = fic (1+) + a'b (140): saclta'bel sacl a’, (orb (al teymaretalb. [sea =0) Proved. Scanned with CamScanner45.32 | Faartets Books Example 4. Simplifi the following : @ WY Wwtdya's, (ii) (@+b +0)’, (abe ta +b’ +e’, fab tbc + be, 4 < (ach + [a+ b')-b) i) [a 4 (a’ b')) fa’ + (wb) () Show shar: e (RG. 5 Dee. 2446 Ob dC He-a= (a+b). +0)-(r +4) Solution :(a)(i) (a + b)a’p' =-(a +b):(a'-b') 2 = (a+b): (a+b)! =0. [by De-Morgan’s law, (a +)’ 4) (ax 9 ) Thus, (2+ b)o'-b' =0, (i) (+h +0) ~[a+d) 1c = (a+ b)'ct (by De-Morgan's ay) = (a'-b')-c! (by De- -Morgan’s yy a'-b’ Hence, ae (ii) rat bot bec! (by commutativiy) (ate) tbc! (by distributiviy) “(a+c+c’) (by distributivity) =bla+(c+c')) (by associativity) =b [a+ w [sete =b1 patisy =. [/ Lis mulipticative identity Thus, ab+bctb-c'=b, (iv) abc 4a +b! te mab-c(a-b:c)! (by De-Morgan’s law) } [vata'=y @) ab + [(a+b')-b) ah +[b-(@+b)" (by commutativity) = abt[b-a+b-5') (by distributivity) = a:b + [ab +uy [/b-a=ab and. bo’ = 0) = ab + [ab]! aT sata'=1) (A) [a+ (aoa! + (a°b)] = (a+ 0'V(a + DN a’ + 0)-(a' +5) os dlistributivity) =[L@+oyI1-(@’ +5) [retaay | = (@+b')(a' +b) [-1-a =a) =a-a' tab tba +55 (by distributivity) [saa =0) =O+a-d +b'a'+0 ab + ab. fa +b)-(b +0): (¢ +a) (by commutativity) (a +b) [0 +c) (c +a) (by associativity) ! (a +b) '[(c +b) (c + )} (by commutativity) (by distributivity) +b) (C4 b-a) = ac tb-cta-(b-a) +b-(b-a) (by distributivity) si. Scanned with CamScannerBoolean Algebra | $33 = @etbe + (wa) “hb + (b-d)-u (by commutativity and associativity) CHbctad tba [yaa suete) c+ bc + (a:b + a:b) (by commutativity) [vata=a) Factbctad (by commutativity) btbctea HS AQYartar tata voi vaben i Solution : (i) LHS.’) [vet =a) fa’ + a)-(a' +b) : hsb (i) ae (a’ +b) =a’ tb = oy i a R —— Bs 4 ki : ke : : Scanned with CamScanner; “534 [Parity Books Example 6. Prove that if { B, +,.'} be a Boolean algebra, then (a+b) +e=a+ (b +c) Va,b,cEB. Solution : Let (@+h)+enx and a+ (b+c) wy, Then, ax salad) +c} oe . =O (arbrae (by distributive lay) sata (by absorption awa (a + 6) = a) i a (by absorption law,a +a-b =a) . (i) and ay=a{a+(b+c)) =a {hy absorption law, a. (a +b) = a} . (ji Comparing (i) and (i), we get a:meiayy. WoW AX) Also, x= ala +b) +c] axes a'(a+h) talc (by distributive law) or (aa +a") + alc (by distributive law) = (0+40'-d) ta’ fra-a=0) Ralb+are (iy and ay=a'-la+(b+0)] a +a!-(b +0) (by distributive law) +(@'b+a'-c) (by distributive law and a’-a = 0) =a’ ta’, [sa+0=q) Wy and (iv), we have a. i aes 7) Again, by (X) and (Y), we have . axtax=aytary = (a4a')x =@+a')y (by distributive law) = lxsly [vata=y e y lex =x] eat (a+b) + a+(b+c), : , Note, Cancellation law does not hold in Boolean algebra, - Example 7. Wat+x-b+xandaty' zn Solution : We are yiven bet +x" then prove that a =b, atx=btyx atx'=b+x" G@ +2) +x) = 642 64x/) atx =btx x a+0=b+0 : a=. 8. Wax =bxandax' = bx", then prove thata = b, lution : We are given (by distributive law) (by complement law) (by identity law) ax = bx (i) dat —bax! ii) axta x + box! a (ets) = be +x’) (by distributive law) Scanned with CamScannerAootean Algebra | 535 or aia) y a= | Keates, Wa,d,¢ © B, then prove that ab + {c(a'+b')} = abte Solution LHS.= ab +e-(a' +0!) =ad+e-(0b)' (by De-Morgan law) = (0b + )-(a°b + (a°b)') (by distributive law) =(@b +e)1 (by complement law) =abte (by identity law) = RHS. Example 10. Prove that : lata'-b)[a' + ad} Solution LHS. = [a +0! D)-fa' 40-0) = (2 +4')-(a +b) :(a" +a) (a’ +b) (by distributive law) = 1(a+b)1-(a' +) (by complement law) = +a)-+a') (by commutative law) =btaa (by distributive law) +0 = b= RHS. ample 11. In Boolean algebra [B, +, .,"} prove that : @&r@+y))' + WO +2)" + WO" +x) }' = DH Gi} G@-y! + yz) (ez tyz') = 12k [R.G.PY., Sep. 2009] oi : ; ee) i) +y2)-0" +3)" +2!) =x" +2) ! solution : (i) {x'-(x +) }' + (y: +2')}' + WO" +x) }! { (i) + G+) ty 4 +2)" 4y' +O Fy! De Man ; =GHG YH FOV FY HONS Soe | saiaty!tyltytety tye! Lael / sxtyxbxty' ty ty tyx! 5 } axl ty) ty (tx) ty tye! Ree ¢ saty' + +y) 0 +2’) ; arty 41! $2!) f Tie este ty! H ty a1, } (ii) (ey ty2) Gz t+y2 (xy! + y) @ay' +2) (vz +y) RZ 42') ’ (e+) O' ty) E+2) 0 +2) G+ Ety)@ Hz) E42) (ety) 1G +20 +2@+)EFy) HZ) 1 a+) tNEHIEHIE HIE +) =(ety@tzz)@+yy) = (ety) (x + 0) (@ +0) a (ety)xe mane bays mart aye eaztysr=xi(Ity) saz lExz, Be zy | oy f % = = : : . Scanned with CamScanner5. | Harwety Books (mG +92) #4). ey tye ayety) +2) =O ty) (ery) eta #2) OF yy OH 47) (Eta) $2) artes re, = Wtragy' tz) ex ry +2) . SEY! $2!) =i’ #7'), Example 12. Boolean algebra [B, +, -,'}, prove that: @ a@+b=Oee-05-0 (i) ad" - 080’ +4 21 aia +b ~@ 1 candah=ac sb 70, 2(@) Leta = Oandb = 0,thena+b =0+0=0. Conversely. Ifa +b = 0, then a=a+0 sath =(a+b)-(a+b') =0(¢+b') =0 b=b+0=bta-a'=(b+2)-(b +0) = (a + B)-(a’ +b) = 0-(a' +b) = 0. @), ab'=0 ° (ab’) =0' . cd a’+(b''=1 - “(Since a’ +b=1, 5 (iii) Let _ @th=a+canda-b =arc, then babtbu (by absorption law) =bb+ba= bb +a) ~ bat b) ~ b(at ce) (givena +b =a +0) = bathe =ab+bc =actbe=(atb)c (given a-b =a") Fatcesactor (givena +b =a +4) Faetometeu =o(1+a) =¢, (oitaster=9 |. Algebra of Propositions this section, the truth values will be alloted tha evmehat-a-— 4+ x5 Scanned with CamScanner. Application of Boolean Algebra in Switching Circuit ~~ Switching circuit and its applications. Switch is a device, which can control the flow of the current in electric circuits. The propertics of the Boolean algebra can be used in the logical designing of certain clectrical network. Such networks involving switches is our subject at present. The switches can have precisely two mutually exclusive states, namely, ‘on’ and ‘off. In the ‘on’ state, switch is closed, consequently, the current flows whereas in ‘off state, the switch is open and the current does not flow. The two stages are shown in fig. 1 and fig. 2 respectively. Fig. The variable state of the switch is represented ax given below . A————e x e—_____3 Fig. If the variable state of the switch is denoted by x, then.x will have two mutually exclusive values 1 and 0. Thus, when x = 1, the switch is ‘on’ and the current flows whereas when x = 0, then swilch is off and the current does not flow. 53.6. Combination of Two Switches in a Circuit If there be two switches, in the clectric network, they may be connected in two wa (1) Inseries, (2) In parallel. 1. Switches in series. Letx and y be the variable states of the two swilches conueeted in scrics, then the combined state of the two switches is represented by the compound form (x-y) or simply by xy. Diagrammatically, A 8 ko B ey or @y) a consequence of the above net-work, wve have the following table : Scanned with CamScannerKy | | =o) 0 =5) ‘ative law) not‘ =") sfeertain can have ns Fee is L wt his olf 5, then by xy. Application of Boolean Algbra | 24 | re i f pees ‘ att att the above table That the current does not low in the circu when any one of the ; - ee < eb : 3 ree Exercise 5.3 1, Find the Boolean functions corresponding to the following networks : Y \ 6 ES | ree a hay oO) Oe ) bE: SS ae : —eae——eb W A—tea e——-e B —e a e—— Scanned with CamScanner5.48 | Variety Books 2, Sketch the folowing newvorks and simplify them rte pty o' +2), ((c4y) + 42))2 ene down the switch funet ified equivalent network tions for the tollowing figure and draw simP! ii ! i Answers 1, (xyz tayttxyztryt Gi)xy z+ Qty ' Gi) & + ye weet 8) 4. (iv) (@-b + ave +0 -b)-c'-(a' +b + 0) (Ward tab! +a'-b! ir 2 : peti ae F ' 7] xe ee ey ate 0 hb Lye mn | xy2t Jd Simplified form 2 ask gis : eee x Simplified form 2th tr 2) oe ce erpe bY Are ae) ee eo DA the Fez: BG ES 5 eS ie ad Simplified form } : eh ameK7r ae A A yo eS wey ey ezen un ‘ \ MWS drat yy! \ ed) fe 24 2G ®) My ee seae dua rust eee Ss ) UAC a] wrazryer ye : ed Sie Sd meray yey2 ia F é ; 8 Ly. or : = a aya? a d 2 eciee alent? Scanned with CamScannererr, Unit - \ Chapter - 4 Boolean Functions $4. Fsroduaiog Has chapter we shall come across the words constant, variable, Boolean function and its forms. Therefore it willbe better to define some preliainaries reparatorysto the topic concerned tan onstant : Any symbol, to denote some definite element of Boole, algebra, is called a constant of Boolean algebra. 0 and 1 are two constants in Boolean algebra, ean arta : Symbols used to denote any arbitrary clement of [B, +, +] are called variable of the Boolean algebra. 0,8, 6,2 nn 46 are used for vartables of a Bed iea, algebra 2 Expression An expression built up from the varables.j,2, sy JZ. With the use of Boolean operations « a finite number of times is said to be a Boolean expression, Thus (i) all variables are Boolean expressions, and : (©) ifxandy are Boolean expressions then s0 ae (r+ )),x-y and! Ie cam define @ Boolean function corresponling to cach Boolean expression, Let Hy oop) be Foolean expression having its variables among (25, ...2), then Posy »%) will denote a Boolean Matian. In order to make the corresponding function unique, the varablen 1, are always listed in the order in which they occur in the list. My +x determines ie function fy) 2) 1 x’ then 0,0) =0+1'=0+0=Oand(0,1)=140'=141~ 4 ‘Two Boolean expressions are called equivalent (or equal) ifone can be obtained from the other by a Anite numberof applications of the ideutites uf a Boalean algebra (A Boolean expression in variables x4, nh is called symmetric itinterchanging any two variables resulls in an equivalent expression, © $4.2, Boolean Functions ombination of constants and variables with finite applications of the binary operations and the unary eperation ofthe given Boolean algebra are called Boolean function. For example, Str ry C02) ta'yhe ete i In other words, Ket (2, +, 10,1) be a Boolean algebra. A function f: 8" B whichis associated with a Boolean expression inn variables is called a Boolean function, Nite. We may write U for ‘+? and for" while writing a Boolean function in terms of sets Note2. The number of variables in any lunction isthe number of distinct letters Present in the function. a andi are taken to be one variable. Thus a + a" a function of one variable while a-b" wad nh are‘the functions of two variables. Boolian Functions | 5.49 Se % ¢ Scanned with CamScannerSET TT ae 50) Yariety Books J from a given set of independent can be forme ee of Bolen ‘ of distinct Boolean functions that function of that set in Note3. The totality ntal Boolean fu 4 e own as the set of fundamen Boolean variables is kno Kariables, A. Types of Boolean Functions eration ‘+', °°” is called a er Monomiat : Any Boolean function which does not include the opera Monomial examples Lx-y', 2e"-y2 do are ealled Polynomials ies sum of Polynomial : Boolean functions having ‘+ signs |N! di Step 1. Simplify the given function to contain minimum number of terms. Step 2. Multiply each term by as many 1 as the aber of missing variable, in that term Step. Put for, inthe term which doesnot contains, asx +x" = 1 and gna epacement should be done for each 1. Step4. Apply distributive taw x-(y +y') = x-y +2-y' ete, atid See that no term is repeated. If so apply idempotent law, the result willbe the required disjunctive normal form a Illustrative Examples Example 1. Express the Boolean function, S(ey2) = [ety y'2)']" (a)Asa polynomial, (b) Inthe factored form, Solution : (a) L(ey.2)= [eet y')-(ey'-2)) tains minimum number of terms. In this method use = ~ Scanned with CamScannerfe ane here os wey Heyer [by De-Morgan’s tnx} ae yt (rer) Iby De-Morgan’s lawand (x')' = x} erty tuys ing two terms. i SERCH raya ie drier tt ™ Seen yrd ira) Kena roy tayoe ~ eaty tuys Bee try [by ssid Be TO +y) wanes 2)(by distributivity} SEEN FY) LW Fay +4) bs 242’ tee) =O ANE Hy) 2-942) which jg fonction in factored form, ple 2. Obtain the disjunctive normal form of the Boolean function fexylztx'2, Solution : Since the second term of the polynomial |f docs not contain y, hence multiply 1 =y+y" and simplify, we get faxyoztx zl Sxylztx'2(y ty’) Sxyortx ryt! (x-y'+z) + (eyez) + ius the function f has been represented in canonical form. iple 3. Find out the disjunctive normal form of the polynomial yz). ‘ L@&yAD=[EtY) +427) tyz lation :f(,y,2)=[(+y') + +z')'|' +yz = ety aye)! | a yz [by De-Morgan’s Sue Foto sltichiy 2 ae i =[rty'(1t+z))' +yz =[xty' ll tyz a fery tyz =x' Vy tyz aatytyz ‘ way l+lyz axy@tz')+ (etx )yz sxlyztx'yz! txyztaxtyz ar ax'yztx'yz txyz, ' Example 4. Write down the disjunctive normal form in minimum possible variables of the following ceiy, (b)x-y" tace tary, (uty tw) (uy tun)’, Scanned with CamScannerss © Solution: (a) Eyes ay Boolean Functions | 553 HEO ty) tery wich is the required disjunctive normal fem eo (ey ae ee hormal form in minimum posible nner of variables Vert tay Y°E+2) tery ty!) tay +7) i Yobey la teny tery trey teys x bacyl2! q Pe reay ad teyatayatay7 txy7 (by commutativity] yz) + yz) + ((x-y-z) + (ey-z)} + feyz! txry-z'} weybr bayer bx: bel tye" i , Seyateyln brya! ta which is the required disjunctive normal form. : (c) The given function is, (ut +) (uy wy! (ue tv tw): {Ce v)'- (uv)! } (Utvtw) {Ql tv) (ut wp = (Ut tw): (ula daw! vow ty ow) (uty tw) tul-w yu tyiw') (uty tw): (Uw! + out vow!) weulw! tev tev wt yeulw! tv visu + vv'-w" wei! wl tev on ew =O+uy tue tu vw! +0+0+0+u-v wt0 [by associativity, commutativity and u-u" = 0 ete] uv tueviw! Lulevav! tw uve lta wl tuy wl tuevw . yb a) ac! wt ba va break suevew tuys Ih evil buy ! bev {(e-v"-09) + (uv! wy} {uv ve) + ev wt) eee Se ueviow tb ueyt ew! pul ve! [vata-a] which ig the required disjunctive normal form in minimum variables, Example 5. White dinwn the function { (x.y) xiven in conjunciive nomial forme ta its disjunctive normal fodn, wheref (ny) = ty) tye +I) u 0 ‘Solution: (& +y'):@ ty): @’ +9) i e@&ty)@' ty) [using distributive law] i = @+y')@ +0). [ey = which is disjunctive normal form of the given function. Scanned with CamScanner554 JgMriety Books . ppl, Conver the finction, LO. 2)™ Cb yy Get et) + ike’) {nto disjunetivn normal form. Solution sf (%2)" (HY) HR + YY Hz) BOHR) ayaa! [by distributive tay) mat Ore ty) tat [by associative law) mty tet [by absorption law} . mld yd tay SPOT) AGE) beet) [le yty=y EYE by ety bata atx! (by distributive and commutative law) Fey be yd hx | chy! [ery tary ry SET bey bbaelyel tated patatel PPE) $e 2!) ta! yo(e Hr) tz xyty) tz xO ty) [since first erm is missing z, hence 1 =z +7’ etc] SEER bay e taeyt! bat yat at yer! +rory tatxy! ta! y + 2'x'y’ [by distributive law) Saye t (eye! tay2!) bayl2 + (eyla! taryz') Fx yet yz tx' yz’) tx y'2 ; {by commutative and associ taylzbaryl2 t xyz tetye2! bay’ Zi bxty’ exyzery Sxryzdxylztaty2 bay! tayte! txt which is she required disjunctive normal form of the given function. \ Mample 7. Convert the function 6 £(6y,7) = (oy! baz") bx! ‘into disjunctive norma! form, rf Solution : LG592)= (ey tz!) +9" = xy’) @e’) $2" [by De-Morgan’s law] Sh + 9) b' +e) ] +x" [by De-Morgan’s lav] =f ty) be +2] ta" aa tyztx [by distributive law) Salted yz [by associative law] sai tyz ax l+lyz Oty) + & FX) yz extytxly tayz tx yz Lexy Lbry2 bxely2 yilet2)+xyo(z 2!) txryz bx yz axyztxy2 txryztalyl2 trey tx yz aapzbxry2 Vxtyezbaxtyh2! bay, Scanned with CamScannerBoolean Functions | 55 Example 8. Wite the conjunctive normal forn uf tei for of the function, a ie (ry tae)! ty law] Stay fey! tava)! law) ee aa [by De-Mosyau's law] law] Sty) Gt) 0 [by De-Morgan’s law e BR ty te) (te +e!) [by distributivity] =) = {Q' +2') ty) (Ge Hx) +2") {by commutativity and associativity) law] = Gt ty): +2’) (oe ty =r] om — ( +y +0) #2 +0) = Gity tee) ('+2'4yy") [e271 =02yy] Sty) Fez} dete) tyy') te) Qty +2) Qu! ty #2!) z+ y) GQ #2! +y') [by distributivity] S(ity tz ty tz'@' ty’ +2) nnjunctive normal form of the given function ww] which is the <_ AeBersile 9: Find ct the conjunctive nana form of te follow Junctions in three variables a,b and c . ‘a) @, 2 3) (b) (@ +b) -(@' +b’), Solution : (a) fla, b,c)= a =at0 ‘ t =atb-o' [: 6-b' = 0) = (a +b)-(a+b') i [by distributivity] (@++0)-(a +h’ +0) (a+b) tee’) (@rb') tec} 1 at btc)-(abb+c') (a+b! +o) (uth! +e’) — [by distributivity] |) Which is conunctive normal frm of a Boolean function of single variable a in three variables. (1) Let the given function be denoted by (a,b, c), then | J (a,b,c) = (a +b):(a’ +8’) | = (@4b + O)(a' +b +0) -@Fb +c) (WITH +e’) = (ath tc)-(atb +c')-(a' +b’ +c)-(a'+b' +e’) "which is conjunctive normal form of the function. Example 10. Change he disjunctive normal form xy" | x'y+x'y into conjunctive ndrmal form Solution: x-y' +x'-y'#x' y= Qe ta')y try By iha aytry =O tx) O' ty) sity) i= ety) Scanned with CamScanner5.56 | Variety Books | iple 11. Express the function, Sey2) = (e+ y) OHH) OD into conjunctive normal form, Solution : ME) = Fy) HY) Gl A 2, eps oy: tae)» Ofer +O) Set yera') (ey) teed de #2) 499) [since z is missing in the first two factors andy is missing in the third factor, hence 2:2" replaces 0 of the first two factors andy-y’ in the third factor} = {ety tay (ety te) (ty t2@ ty +29) ee [(r tn tye +2+y)) [hy distribotive law HOH FD Wty tr) Oty tty tz) tyt De Fy 42) »njunctive normal form of the given function. (When the number of variables used in the conjunctive normal form is minimum ) @& +y)@& +y)}-@ +2) {by associative law] =(@+yy))-@' +2) [by distributive law} +0)-(@’ +2) 3 i = +2-2')-@' +2) [- = +2) +2')-@ +2). is $k€ conjunctive normal form having two variables x andz only. imple 12. Convert the function LOY) = &y xy)! +2! which is the required co: Alternative methos FG Iz, whi into conjuction normal form. Solution : L(y) = (ey ty) Fx" ; HG I yy tx = fell ix arty x =r +0 =a tyy" = ty) ty"). Example 13. Find out the disjunctive and conjunctive normal, th ES feye= Ete HNN Oat ema [e+ + y)' Sle + i . = HO) YEH OY +e} Ee sO Aaa 1 iby ae ‘ ex(Qty+z) 5 aor ay, (2+ nee [ @+a-b = a} [absorption law] ee ate = [by distributivity] ay (¥ @-@ +b) = a} [absorption law) ead Scanned with CamScannerBoolean Functions \ S57 =P Oty) G42) Oy) + @yye +2) [by distribnutiv ‘ tyztarya' tay etary which is disjunctive normal form of the given function, ‘Again, since we have F042) =x+0+0 a PQyz)axtyy ez {yy =0=2-2'] @ ty) ty) tz {Qty t22'}{ (ety!) #202’) [by distributivity] = @ty tz) Oty tz) (ety +2)-Gety' +2’) [by distributivity) which is conjunctive normal form of the given function. OfExainiple 14. Wrie the folowing functions in coniunctive and disiunctive normal forme in theea warinhlo Scanned with CamScanner