56 Several ther sybils eg. ~, ‘are also used fr the complementation symbol I~ sed then 3.3. Evolution of Boolean Expressions using Truth Table ~ Wis ends negation of andi isused then X isread ss complement of X. NOT operation is oye variables are combined by means of logical operators (AND, OR, NOT) to fon snglar or unary operetion as it operates on single variable, Venn dlagram for X is given sition Opes Fig. 3 where shaded area depicts X isoen convenient to shsten X. Y.Z to XYZ, and using this convention, above expression (OR Operctor ’A second important opeaior in boolean algebra is OR operator which denotes operation called m and the symbol we use forts». The + symbol, therefore, does not have the canbe written as -X+¥Z+Z logical a weema meaning, but is bial adtion or logic OR symbol. Thus XY can be rbd as To study a boolean expression itis very useful construct a Tony. Beck pemton te Pase nts opt combats aes ows table of acs forth fren and then tease the o+0=0 sie “ ‘wah have 2" input combinatons, patel “ eres aan 10st wes Consider he expesion X + YZ Mee thee vars XY, 2 ah ee rplocements forthe = sign. Computer people stl use the ‘ymibolonginilly proposed by Boole. Venn diagram for X ‘is given fig 3.2), where shaded area depts X+Y. AND Operotor : i AND operator performs another important operation of boolean algebra calle ogc! mal Fi jt ad the symbol for AND operation is() dot Thus X.Y will beread ss X AND Y. Th Piece ce 5 columns added to list YZ (Table 3.6) ott enemies ules for AND operation are 0. O10 CO hace Pon ae as sn the tath table for AND is as follow x Tovieae m BHE36 Yat rable for (¥.2) x ¥ | X.v(te, xanon 0 1 o =‘One more column is now added to ist the values of YZ (table. e347 Thuth Table for YZ ond V2 eS sceetatat fost |e =] Now values of are ORed (lag! addton to the values of Zand the resultant values Contained inthe last column (Table 38), Tables Ten Tobie for x 072 Brawrie Hy XY=Xforawh XY Dh SOLUTION ‘As the expresion X-+ XY =Xisa two-variable ex owe ruite posible combination of values OFX Y “Table wil eas fellows 1 Comparing the columns X + XY and X, we find: both the columns are dental, hence verified \ 5 ‘usr BOOKEAN LOGIC | Brae BU Boks lagi ei wing a abe Wa VPS for eh, VAIO. Th SOLUTION As tsa 2varabl expression, truth table wil bea follows x 7 ee | ee a [0 o ° 1 py 1 | 2 1 1 ° 1 0 0 1 0 i fh i 0 1 a 1 a ° ‘Comparing the cous (X + and XY, both dhe column ace kata, ence wie BaP EY Prana at conta oh linge ogicepmesine @Y+RY — @xVa+K¥2 © (RZ +x¥ SOLUTION (0) As EY +V is a 2-varlable expression its truth table is as follows 7m i re\ s COMPUTER SCIENCE YATH THON =, chop 9 /8001EN LOG 59 SRE Fe a fe ig GAA BASIC LOGIC GATES (oH Dex, xT oateo+e) “After Stannon applied boolean logic in telephone switching celts engineers realized that souupON tCotan alge ld be appt fo computer acronis 5 wel eo apenas Irthe cmputers, thee boolean operation are permed by Ti ts Ocal What i 0 Logic Gole ? (eau z [wep [aren] oy | arene 1a cate basi electronic circuit which operates on one oF more signals to produce an output fats pe ae a a heals sca hacer De ° ares are dg wo-stat cuts because he input and output signals are ther ow volage ote eet | a Ca aie vag dena) Gates are often cle agi cia because they canbe a maracas epee pant wid olen log These ae tree types of ogc E> ee a ay | s ; < laverer (NOT gate) a | On got pose $+ bo encrne cor agree ad 8 soe one Settee oromen | 1 2 a 1 4 " 0 A _ ‘more signals to producy | ae a patos] || — ae | 3.4.1 Inverter (NOT Gote) eee 2 = ‘An Inverter (Not Gate is gate with only one input signal at OT a aT seer 1 ate (Truth Table for XY(Z + YZ) +705 fl 2 ee ofthe input state tay one mp ea! a f AAninvertris lo called» NOT gt Besse the opt not inate ei ep Te ot = sine a! oe oe arc oe Priore opps oe vse sane Eau Following tables smmmarise the operation ——! ts Je39. Tath Tole for NOT te she 310 Alero Tsth Tele for NO Gate os ase Lae gee igh 0 1 a oe f tae 1 a ee eee = sae fnputie0 produces igh output i 1-and vice (oy Tath Table fo AUB +04 is 8 lows The gymbel for inverter is given in adjacent a ei. a f Fu 3.4 MO bol fas Gate [Gate has to or more input signals but only one output signal. If any ofthe input ele 1 (eighth outpet signal i (ih are then ouput ils 0. If ne or more inputs i output is [Or CAE Ganhave ss many inputs (or more puts) 2st aguas alter how many inputs ae here, the action of bution of hero ame : one of more 1 (high) inputs produce sus 3hon ds 9 BOOLEAN 60 somrren SINCE WH PYTHON — a Following tables show OR action, () X.Y.2--> . signifies AND gate, hence only AND gates required Jouesst woimwtonone Tle? Meche iG, 0» ces Not ce Sp A fe MP ae ge ae (i) +e ~ss NOT and gies Of hee NOT and OR gn a eo eis, pada en Gage = Pe ag ( PLGeR > sg OT and gif OR it NOT and Op — ahplhaniecotien (0) #.bs€.0-1— apne NOT pis AN nt pes Oe NT AND on OR 1 ceo yas SELifs NOL pues AND, Hanae NOT and AND pss. aap ote rete pad cae) oe Fg 3.5 BASIC POSTULATES OF BOOLEAN LOGIC Boolean logic algebra, beng a system of mathematic, consist of fsdamental es that are used to bulld a workable, cohesive framework upon which are bared the theorems of boolean igebra These fundamental laws are known ss Basic postulates of bolean lage algebra. These postulates sae asi relations in boolean algebra, that follow 1 X40 then X-1; and Wf Xel then X~0 [TL OR Retasons (Lagi Aldon) 40-0; O+1=1; 140-1; 141-1 ae =e ae 3.4.3 AND gcte “The AND Gate cn hve two ce mor than to inp! spats nipoducan ouput sgl When al heinpats are, high Te AN Gate on Fv 0 LAND Keltions (ai Mutton) ‘her the np 1 oterwi opt et ere ars 0-0; 0.1-0:, 1.0205 1.101 Hany oftheinpaiais0 the outputis Ta obtain outputas, erga ese AV. Complement Rules: 0-1; 1-0 ailinpts mst Be ‘enone obeainaze ‘an AND gate can have as many inputs or more inp) 8 9° an SoA era Tas cn reo See e338 Tm ngne TRI Meer OS es =e faa "hanging each OR sgn (+) a8 AND sig () ee _—e pe jem mans) eee botaged Bier ar by 1 ond cach 1 by 0. al Fea vu eaeiaie ellis eatisasn mete ce a 7s a ae Now working according o above guidlines, +s change to () and O's are replaced by 1's, these become : on (10-0 ina. (i)0.0-0 "which ae nothing but same ata of postulate lf lated to logical multipiation.o i i foare the duals ofa, e& <1 Well be applying this abt principle the theoremsof ‘olean algebra which sour next topic figce 35 (6 2inost AD ate (0) 2Sepat ND te (2) np AN ae Fri expen ot as tly te gi gates al om leet suk ep UyXer Ww) PrO PHO (ew ABC omz aye (oy ABCD.BASIC THEOREMS OF BOOLEAN ALGEBRA/LOGIC Basic postulates of boolean algebra are wed to define basic Heorems af bolo alge that provide all the tools necessary for manipulating boolean expressions, Although simple In Eppearanc, these theorems may be sed to construct the boolean algebra Properties of O and 1 (@0eXx (90.x-0 Proof. a) 0+ X=X “Truth table for above expression is given below in Table 3.15, where signifies the out Table 28. Trath Table forO +x. fig ot] 8 Se ss fs X can have values ether 0 or 1 (pestle fy both, the values ORed th 0 Produce the sae outa hat of X Hance proved. @tEx-1 ‘ruth table for this expression is given below in Tale 3.16, where R sgrfies the outpt. asle 336. uh role fora--x ‘Again X can have values Or 1. Boh the values (Dan 1) ORed with 1 produce the ‘utp a 1. Hence proved ‘Therloie 1 +X =1 sa tantology @iexe @1x-x (0.¥=0 ‘Asbuih the possible values ofX (0 nd 1) ateto be “ANDed wth sth th ble fortis expression {as follows where (R signifies the output) Table 37 Tuth Tobe for0.x=0., ae Cl iets Both the values of X(0and when ANDed with fprodce the output 0, Nene proved ‘Therefore, 0.3 = a fallacy WwExex [Now both the posible values of X (an 3) fo be ANDed with 1. Thus the truth table for willbe a fellows asle ait run rove ora. =x [Now observe both the values @ and 1) "ANDed wi 1 proce dhe same opt 2 X, Hence proved. Hore properties and ¢ dus of each other and properties «and Gols ofeach ther epi tootean occ 3.7.2 Indempotence Low “This law states that @x+x. Prof. 4a) X4 X= To prove this law, we will make truth table for above expression, As X i to be (ORed with itself only, we will prepare rath table with het possible vais of Xie, Oand “Tose 329: rth roe forx 2x =x 0+0=0 ad 1-1 (of psa 1) (ef psa 1) > X4X0X, a5 it holds true for both -yalues of X. Hence proved, _ (@) and (are duals of each‘ther Insoletion =x Iga calle double esion ru ntaiy Low tate that x.x=x X.x=x Here X is ANDed with itself. Again we will prepare tuth table for this exprestion taking 2 posse values ofX (Vand 1) ‘Toole: ath 3a for X= (pst (6g pstdte SX X= ab itholds tru for both values of 1X. Hence proved.= \ 2 » be 9 ROOK LOSIC oS 64 Toole 3.26 Truth rable forx ay +2)=0e +¥142 trot @) 4X1 x.-0 ie wi prove X+E-t withthe help of| Traber ere allows Pow La a te able which ven blow ow oa iat ca “ 2 ees ° : 1 isleg22 Truth Tod for = Tovte3.23 Tah Tab or R= Wee con bt : : i a lee te ea i ae Dini aif 1 1 1 1 [gna ame et on ey Sega oes : i : Herein thet ctumnpomibevalvetX]qg0.1=0 (peste) err erat i fe fave beet taken, second column cpnsists Of |g tof pstlate 2) ‘Compare the columns X +(¥+Z) and (X-+1)4Z, both ofthese are identical, Hence proved! Sine rte (ial fra Rene also rove. values eomploment dues of %) X and X alues are ORed and the output is shove in {bird column as => X.¥ 0, a5 it olds tue for both the Values of X. Hence proved, Obsere Here X.Y =i doa of X+X #1 37.7 Distibutive Low Thistaw sates that: (0) X(C+ZIAXY ORE ()K4YZ= (+ KZ) eer tre pai 1 (Cp pate) | Changing (+) (sd 110 ad we get Pot) Tit able fr X(¥ +2) XY + Zin en low x4R eh sithaldstrotorbot possible) X.K=0 a xFapeins pos if le 327 Th Tole for XW --2)=XY 4X2 eis filly iia Hence proved, It isa taolegy. aay 2 | NOvez) rex a estado '| 37.5 Comimuatve Low | Deer | mors to “These as state that Peet Aienl @xeayeoR — O) XYHVE \ art i | pha Sess | @xererex OxeY-X " | eas the ols X(7 +2) and XY YZare ental ence prove. ‘Truth able for X.Y = ¥- Xs given below “Truth Tablefor X += YX isgivenbelow: } +n ‘tle 325 truth Tole forx.¥ =¥k ule (hi dual of re), hence iis also proved ‘rauestlotioas | | aie 5 Bore te giving te algebra proof of law X42 =(X-« )(K42) = i eae re ie het aa ee Fe eames ae th ore ave ei Soap en Yan 7% | wf ees £ A rst pom oo et (X.1=X, property of O and 1) ff these are identical Hence proved: ‘ential, hence prove. FAH YZ=XA6 YZ (1+ Z~1 property of 0 ond 1) ez (OC1=X, propery of and 1) 37.6. Associative Law ‘These laws sate that XO D(Ko4Z — OXON (VIZ root) Tet table for X+(Y-+Z)=(K +1] +a given on next age on tru hen al lot.\ 67 {All the theorems of Boolean algebra, which we have covered so fr, are summarised in following table te in the 3.7.8 Absorption Low pcontng ist: @XSATEX EK re. “i [Pirin go Jornax, 0am (@ xaxv=x loxaen=x 2 Tee Taig = | lee) ae =a ‘Truth table for X + KY =X is piven below ‘Since rl (is dual of ral () iti ako proved me RRM © ESE : : | Seas Grins tener ot of Clee lee Joona matrawprestrox | tol ee ee fine ones ead ez LHS =x06+ =x.4207 ee : rea toe et oxy seis [svar] _B7R pagent Joa sant 2. | auwcatoetno | X20¥oZ)-0k1)42;_xOB=ONZ | on CX: eee ow | cis |e ay WE: eek 8-7 ligne et a+ | ters Ta / cat X and 0 ae ie eee ma tn SIME fsotcan be rove gna tengo it) wi Geta eV OD) - MS BEMORGAN'S THcoREMS Hence proved. ‘One ofthe most powerful identities used in Boolean logic is DeMorgan's theorem. Augustus Putting + ¥=1 ef proptis of 0,1 Thor 1) XiteX = RUS. (nf properties of 02) Hence proved 3.7.9 Some Other Rules of Boolean Logic Algebro some more ries of Boolean algebra which ae given below Dabogun fad paved the way #0 Boolean logic by discovering these two important theorems Br rratacs tec teorene of Debonan. o J DeMorgen's First Theorent states the X4¥=X¥ “To prove this theorem, wee need to reall complementarity ws, which sate that XeXel and X.X-0 ie Fo a ruven anti irr) id sib nib iba on oe susie lopn ment eye in a Siiiannscnnaccr fuel prop fer mt ‘exercise, the other proofs ofthese be} fe prove DeMorgan's frst theorem, we will use. complementarity laws. X+RY=N+Y set fae PX, is aa PB fe ie Logical/Boolean variables. Then, according to P too In other words fP ie, it X+¥= LHS =X+XY (6994 ¥ mnt be equal to (eXe%=9 Hence proved xatky (ting X =xa+n+Y (asting 1 a5 -¥0 EY =1 property of (06 +0). ¥ mustbe equa to 0. exiten exexy+RY x4 +%) 5 é Ker (064-1 complement Cu pag ae (of Ke vZeCeH NIK Z =xeY property 9 +140) eae =Ruts. 1 bg So fist pat i prove.\ . 5 op 9: BOOLEAN LOGIC 69 Akeratively, you may solve ita fellows: [Now fetus prove the second part 2 = veh ‘AsAs Ab = (AoByeAv AB enutbpe. XY) XoXPY aah vam am Dagens -aa aH (oo KU Ze XY ED ARG (op X¥=9) A.B(A (A+ B)) = AB(AA + AB) =AB(0+ AB) = AB.0+ABAB =0+ ABE =0+A4.0 =0+0=0 0.7+K0 “0 ‘So, second pat is also proved, thus: K+ Y=X ¥ 3.8.2 DeMorgon’s Second Theeyerm "alate ‘This theorem states hat: XY=X+Y Barn id he ple af exes ‘raat Again to prove this theorem, we wll make we of complementarity 1 SOLUTION Complement of gven expression x+Xe1 and XX ¢xY-s complement is X + ehen it must be tre that Ww xysR+H=1 and @ XV +¥)=0 ‘To prove the ist prt Dabs x48 +¥) Gere Ge Kays) (Using DeMorge'’s 1st hers), [ow the secon prt. K¥20.0+740 (oh X04 2) XY i (sng DeMorgans st aw) ted Ke VAC MNEZD =x OF a vByBsE-D) ang Dedorga’s aw (KDE H0.YEX0 Oh XK ; =e mB c+ D> a : oY REK=D =00-0-KFS Tie Coplant ofexpession 1K + Y)(AVZ=XZ). 1 (of 12-9) ay +)-0 Complement of piven expression and HEH H)=1 5 HY-K+Y, Hence the theorem. “Athough the ent sbove represent Deora’ store the transformations more RTA (Using DeMorgan’s 2nd tv) w+¥KrZ.X2) (Using DeMorgan’s sae) performed by fllocing these steps (Complement the ene function = 009+ +742) (Using DeMorgan’s 2d a) a to ORE (+) ad al he ORS) oe 1), mee al BS ANTE SayH OR HZ. 00D ity Complement each ofthe individual variables “This process called demorgavizatin, For extmple, {Changed +o and complemented individu ep fr AB=AB and Fi plemint of xpeasons(A* BC DEF omplesnent of given expression is $Ab AB, AaB (Using DeMorga’s 2nd law) =(A.BC.D)s(E+F) (Using DeMongan’s Ist nd 2nd a) A(B-C).D)+(E+F) (Using DeMorga's 2nd aw) SAGHOD HEP)Ccowrun SiN Wl THON - Nc BOOIEAY OSI. : # 70 ‘Bo ys know yc find he complement Bolen expen sings a1 sil 1 1. Wie he ul form of give0 Boolean exes, 22. Swap aisles ad eampemented ables. For example, othe complemen of expresion (A+ C+ DA) 1, Woes Dua: (8467.04) 2. Replace vais with hei complemen form A" +C)(D/+A) (he ws) ‘Let in the complement using the DeMragh Laws and compare the est | Fa(A+Be'+Da) {A+ BC'+ DAT =(A.(BC} (DAT) i =A‘ +CND' 6A") = AB +E 0 +A) | isthe sme as thé complement determined wing Duaityprinple; 39 MORE ABOUT LOGIC GATES eran snr isk NOT AND fr [a simian) (84 Y)4Z~H+(F+Z)is the dual of K-29.2=X.(0-2) But there are some more logic gates abo which are derived from Te. No Ses he a mt Wy, X+0eXis dual of X-1=X three basic gees (i2, AND, OR and NOT) These gates are more At, wnat, BA on se . coexieoald 1K es Be vance. Ease tr proving the theorems or rues of Boolean algebra it 6 then necessary to prove nly on ‘Ths section introduces NOR, NAND, XOR, XNOR gates. ‘sali: 1 hh. ts provi ihe ere he harem owe rec net, all Bn ogre Te a predicated on this tuo for-one bas. Bene Gate = ‘he Nor Gate has vo or moe input signals ely oe opt ign Sianeli Btn alge XH = eh Fei ut bt yates em Link sees : aX isto tenth ut sgt (igh ether of he wo np ap) oe oat wl SDLUTON hg dy pect Sa Hou Xi Ral aang 000) PSO Goo NOR gost thing ut invert OF pe eee pte eat > NO gan many nats rnp a ei No tes may pees Inplsoe here the ton ofNOR atts tesa, AO eo) inputs produce utp ern Bowie EY cee ne al OK Flowing rth Tables (2.29 and 330) ustate NOR action Gael eee any pomp, aa of 502i SOUTION ‘equations is/are incorrect ? Write the ‘Tobie 3.30, 3.inpur OR gate eas ame om Se econ k — aMPLt ERE Sarr taivn tn iy ee Uh aeak——goatcsalf Beton engenon :O+YHK +2) GQacwes Gauest=4SoUUTION (eacay=4-rBO)CABT~A ype of iy stats het rm every bosken eRe eSS: eee anathet boolean relation can be derived by a (changing each OR sign (+) o an AND () sig Fobsaenen OE oaas |G changing cath AND Q) pn tan OR) SN | ‘Beare WIM Find te copied of expression: AB CD + EF SOLUTION The complement of given expression is (sing DeMorgan's st Taw) Ay BC+ D)ME-P) (Using DeMongar's 2nd law) | = (A+ BNC + DME+ FY Bosc Oval of Booleon Logic : Hane pece ake abot te duaty principe. you cereal the heres and ey ee duly whic undees al Bolan gtr. The petals SR theorems which have buen presented canal be divide into pairs Foresample, | X+X.¥°X IHsdual willbe X.K+1)=X (Rem emir change to + eden: complement O and 2.) fants spvingDeNoret Bete ()_replacing each 1 by 0 and exch Oby 2 aoe er ‘The new derived relation is known as the dual Faz) xly2 ai 2 Wit the sol rot of td aan aed Woot the aee Denies (x +. = 21.07 wil bs: 4 ha the ote “Bek the, (E+E DHCDaRVe KZ HZ hang te Sn? Fi 2.7_(o) Lagat nesving of VOR gt (0) 2p NO “ean NS at) pu HOR aeatie 333 24npue x08 gote B ovie 228 2nput x08 gote 1+ produced is 0 (low). input signels but erty one . o 0 ‘Even o a 0 ° — oo = lig) a | @ o te Beatin ti | 090-0, 061= 1er0 se ea meig of NAND ten Wickes aston | 7 te ay oo is HBC Gin Gv YOR ot Produces 1 (high) output when the inpat combination has “Grensmumberf Following able (3.35 and 3.36 illustrate x £ sg oe “The symbols of 23,4 input NAND gatos are piven below "al Lae Fie cemige * 2 SRE iidegeaans eee fe | 375, 70k ela A EY Arete is | f a “foe ee ThexOR tne ee op my pace Sslatbacies wavs} sere eo OR OL ye pcos a eofe alice |S Lae Lets ffs ral ea ee petation, Thus A In bootean algebra © sign stands for XOR oF OR B can be waiten 36 A B Following Truth Tables (38. and 334)" austate XOR operon noRrst proces ot ice cide ote “Figen 3.10 (6) 2pit 08 ae (0) input OK gate (ino OR ce z ‘Dow @310 comput cM TH PTHON ‘The bubble (emall circle), cn the outputs of NAND, NOR, XNOR gates represents complementation. Nome that we are familia with logic gates, we can us them in desigaing Hic crits Loaic caRcurTs ‘Alogi circuit sa circa that carios outa set of logic actions basal onan expresiion. To exenate a Boolean expression, You ite loge creutand the input values forthe variables of Bowlean expression, ‘ess = cet that in the eo ofa Tgie eeu ui combination of Te gute so tho the cut ofthe Boolean expresion con be deteuincd for varias sean eetiane of input values, Lopiccireuit lagrams are used to represent Boolean expressions ‘hough the combination of logic gates. “The rules to crete a logic crit are 1. Break the Boolean expression in smaller subexpressions, fs " Te olan expression AB » BCD, there are two subexpressions: AB and BCD. 22 For ach subexpression, determine the Tog gates that can implement them. (Refer fo Exile 35 well is 8, {or subexpressions determined in previous ep, AB » requires AND gate [BCD= tequtes NOT and AND gates 5. implement the subexpression sing the gate deere in jesus tee Pp apt 4. Determine te Lag te or spb ining he abexpressios £5 for the given expression, : "yb + joins the sub-expreatons (AB and BCD) ; he Symbol + signifies OR 5 Using the logic gat ot the joining symbol om stp 4, cries the sub gate implementation (fom step 3) ps. 6. Yay! Our logic iret diagram is ready. ey 4.960 fl Let us consider some examples nov. rane MD Designo cre elie allowing" Fa SOLUTION The given boolean expresion can also be writen as follows F(ab, g=A BAC HBA [email protected],~(A AND) OR (AND (NOT-O)OR (NOT B) AND (NOT B) AND, ii these logical operators can easily be implemen form of logic gates, Thi, the crcult Giogram forthe sbove expression wil be as fllows "st ie ‘Dt gr of il crc for te fot FOG Y,2)=06+ 11.08 +Z).0"+ 2. “Above expression can also be written as OR 1) AND (NOT NOR (NUT Z)) ANDY OR Z) rantLeT Us Revise 16 is Bolas expresion ABCD. SOLUTION {The eo hich rl in ter YES TRL) MO (FALSE eal ary cen “The stemets wich can be ried ob Ta Fale oecled gel temas or ah fictions ‘Truth ae ble whic erst lhe oie ve of lag variable sens log whl te pai re oft ghencombis ofc reno any legal tenet or xpress is aves TRUE or scaled logy and resus ays FALSE or fold flag. |, Te cpertionpfrmed by NOT operter i cle omplemenaton an there of completion ore “4 Te pernion pared by OR pera ical og edition oe hres re DeOe0; Ort=% 1+0=4; I+t=1 — een dea is dlgran ° 1 theBalm sion = ABTBCIBYO anne BED Osigna lie SOLUTION naa 20186) 7 eee B16 “% The NOT gate or Inverter (s a gute with only one input signal ond ane output signa; the ouput state is aways the : a afer das ileal eteaniamsen anceps Sie [De lo theme pti ees up 0 ‘Base Palas of Boolean Algebra ae. The Bla xpession: ABS AC ‘Bg ge cr and ei digran fr Bk Dawe Tf X40 ten Xela y X+1 tm X-0 _ a et oR Retain Logica ado) LAN Reta! iets) et 1 Complementation Rules: 0=15 of day sts hat arg wih a bac elation, aaron lan an be ded by Sea Rae agree os mm hl JOR( HN AND) an vc vora andy replacing eck Tad vie ese. rawr BMD Dass alge ore on a ee | 5 5 a A tan pin ERIC DE Beko =e ee meee tsar eae icesianS ot Inn intimin st) =X Senter : a. tS eee L, : seasoned 3, xemnair KO 6 XY 6x2; X VEO 4 YY 42) AO XT AKG XO XaKyexs yy xvsy2+ 2. ft ox ely To Smee 3 reBiC +E Fests ion (=o 2 = 1 Mia i ivesiad 0 gute aed 7 Mh avo one el? 4 When dean Zonas pe 21h = epee hen doe 202008 ge ‘ ‘otis 3 gh eat? em) vezCOMPUTER SOENCE WITH THON — Chapt 3 "BOB Looe 8 aie ati 10, According tthe ssa law OT! ray -ar , seeder: BY=ET ryan aa “ee won nese me bt sc bent sina. par, ow ee EATS oa eprasliey According to the commutative I aerate ra tty nu ar oo eps egy en bw ouput produced is 0 (low). ee @AnAA ee er tc ah iaxainc a5 pret oad nomial Co [Acsonding to the itrbutve lay A(B+Q\=7 2 ong bier exert of oe a a avec ective Type Questions Tacostdling to the DeMorgan laws, the comple- ment of« product of variables. equal fo, Quen tre es 7 eres cama $ (6 the product ofthe complement ct ule Chace Quesions Wi fe lion i tive lap gin 1 Asrding Boies ont A=? (Ok and NOR ores or oa [@)NAND snd NoR or oo or Thc gr tt pois igh cpt for engi fa adh ai th te 2 Ancatng Boon are A: 0-2 ee or tb) A = (6) XNOR oo oa (ano (x08 ‘ Acpptingt Backeya ans: A=? Deh ge produces 0 when all inputs are high 2, 1 wa nor . (@ NAND oo on (ano (anor 4 peering to Benno £ 0°? Bi hn a ng ae ow? wl OA a () NAND be ; oe se toNon The expression forthe Absoepion law i given by i be simplified io seal maa folowed by Ok (AND fatoned ty NOT (ABs An'=A (Aster fotlowed by AND (@ OR fotlowed by AND 6. The involution of A is equal to_ Peep Srmplitied a» wa os fone by OF () x08 stowed by Nor or oo OF alowed by xOR (8 XOR feed by AND 1. en np As ven tan inveterate, he op wl be ant npemert ua OL oor oa wa {@) none ofthese To np of ony OR gate ih hen a (6) bot inputs are Nigh {@) bath inpts are lor [a only one inputs high {6 anyone input sgh 9, The output of peoinpt AND gates hgh when {@) bath inp ae low {t both inposs are high (6 any one int is high (Won one input high that cane determined as TRUBIFALSE are clled statements, id hick alway TRUE for ll inp, stereos hich i aliays FALSE for alps, sere aThe operon performed by «NOT gate ald Prnrers Bolan expen cis by evapping. wh wnd ih —— athe NOR gate produces 1 when al inputs re en dumber of 1's are thet be of ae thre nthe input combina s 6 “7 The NOT gat takes nly —_— input 8 re inthe inp combiaton “Tie KOR gate produces — 10, The XOR gate produces _ when event Th MANOR pe pnts __ wen odd mumbo of 's ete pet SoBe Ta The XN gat odes Rin nmi fae cet pt ‘Twe/Felse Questions 1. Anything ANDesd with ais equal 16 2. Anything AND with a1 is eqea © 2 2. Anything ANDes with a1 is equal to el {Anything ORs with 20 alt 0. |5 Anything ORed with 0 i equlf0 tel. Anything Ofc with 21 ual to itl 2. nytng ORs wih 1s ea 0 5, Anything AND witht coal 2 9, Ampihng ANDed with tet sequal bel 1. Anything ORed with sof sequal 0. AL Anything ORed with sel gual 1 sell es AA 12. Anphing ANDed with ts on component equals “ih. Ansthing ANDes wth wn complement euuat 0 1A ORe with sown complet equal 0 15. Anything OR vit i oth complement el 16. Anything complemented ce equal to its complement 17, Anything completertd twice is equa t the orga 1A. The dual of «Boolean expression isalso a Booka expression 19. if eon expres Tra t' fun wil be Hak 20. The dua of the dual isthe complement ofthe Hooeen expresion 2, Is Boolean expression is Tue is complement i to True 2. m 2. es AAS it ‘a Boolean expression Tr ie dua lo True. [NAND and NOR ae called universal gs XOR ane XNOR are calle univers ae Inverted XOR i called the OR gate Solved Problems 1, Slte which f the lowing regi! (0 NOT gti as cl Dy wren fit (i) Do not ae (Ge) Austria i the world rit champion, 2005 (@) Why dd you come ate? Solution. Statements (and () are logical statements since these statements antes resultinto either re or 2, Pre that X.(X+ Y= by rat le meta Sohn, ed ror. ey [Re 0 ° rom the te ab, is obvious hat Xx +¥)=¥ bec ot the calm are ha fre ii @ xxY i 21 =x? 6 i) (A=0)(A1. A) Meat ABC ABC: AC any principle changing )o() and vice vere aebyreplaing with Sth cciaeee cone MEOH NIX+ 2) ID)=XV XZ god for al vale of X,Y and Z ‘values f XY and Zi onary algebra wheres YZ=(K-AY)(K + Zyl good only for two wae (1) 98 X, YadSolon, Distributive Law Neth shown lw an ei i using rah ble A+BCHIA+ BHAT. 0% Re eae. ae a] LOS | Fe ea lates ° Hip Ebb tecged eee Moar Pelee eae ad 4 : 6 Stated er oatuton a. Solution. Involtion law states: F =X From columns (A+ BNA C)and A+ BC, we observe that A+ BC=(A+ 5) 440): Hence verified ‘rath Tale or =X = are J} . 7 Wey he fis sing Huth ale: () XX =O axe Shite and ery Aborption Uw in Basten Alera (9 Trothtable for X + XY =X s given below Trt Tale for X = XV 2X. Sottion o) Absorption Law stats ( X+XY =X (0) XOC+ VIX ey Tat eae for (8-1) =X given below sour. z wea] wx a eI al eset) rth Tae for X08» xy oe Ue a 1 1 l | ath the camino X + XY and X pe esi Hence prove late DeMorgan' Lae of Bolen Alene end very th a con's Lae of brand wry thom ang tah al (ute 07 DDeMorgan’s Fst theorem states that DeMorgin’s Second theorem states that: IF =K4¥ ‘ruth Tale for DeMorgan' secon trem, ee ¥ : » : P o o 1 o ‘Comparing te columns X-¥ and X+ Y, we obtain that ¥-Y and X-+¥ ae dental Hence proved hat IF = + ¥. Hoyt cambios cb ere i te rat teers acing (inp iar ris? Solution 2" Peso he lowing (a tate an roe te asorption aw alee (Slate Dedorg’s Ls. Verify eof th De Morgan’ Las sing Hath tale Hon (@) Absorption nw state that (X+KY=X and (i) XK V=X sxrexasy =X+xr bx.x-m) bya (9 an (i are prove, absorption law i proved ved problem 9 dual of Bik expresion? JAND|) with OR) and vie vers ad's with Ps and aa 9 ond sand vie vera wet theFa Ree" —SO ‘ati he al of. @) av(@cye(D+) io Fo aBcce(DE GLE + Av EINE) (aviaeoxae =a AC (co) HBAs ABO solton, The duals ‘) A (B20)-640-0) fo ArBx(e(D+ EoGHBABIWCHLT + 4°) (a9 acva=(arB(A°C) () (GVA AB ‘Fin he peer of Bolan expression: A+ (HC) OA Be) 4.8.0) termine the complet of Bea ExPesion Solution. (ass eset yerb*e Solution. (erect vesahye=b=2) “cues eva etarbe 2! eearecetrceat yee 6 aa (ust (Bop oy 108-2) dd vee eye +0886 Ja velybee a b+ 8VE in the compleien of Fad seb! 00 Solution, Given abt acd ac abl ant) (06) 02 68) acyl vsayaees®) spoitd Weave ed) ‘Dams lage cre aga or te ling eset solution. yoasBeera 1. Obtain the Broan Expression othe logics i 4 be Solution, F=XY 2+") 19. Wirt th eqolent Bolan expresion or ne aCe Dg ein a rain (oedongens ore “Solution Y= UV" +UrW" (DeMorgo’s tor) om. (BC), ‘rm ate cir ing for he Bolen expression se logic ret dng forth Booleon expression Fo(AtB (A+B). (Dextonga’s It Ea (DeMorgan's 2nd 'ee oun xs mw oe cet dr or he rs erin Se sisincate ae i Type A : Short, Answer Guestions/Concepival Questions —- = 2 Whats meant by tatology and fallacy 2 Prove that 1+ Yea tauttogy and. 0.1. fallacy. 5 44 What sa truth table ? What ts igiicance ? Da Wt ene oil alge? s Sas coe sey ee ne Wr uy ‘ & 7c aro can alg on oe te nt ne ern pt? Das $ Fv peti ten gw ssh e ‘ i Fs rns pt ceptor tn i ee 4, What are Deon toes 7 rove aes he Morgan's tore |. rmw loi cre digram forthe Boole expression: X sara terse 12. Which Boolean Law theorem do you use to determine complement of 2 Boolean expression 7 sao a ayn mpsana ee? = rine saan apc a? ot 5 Dos mec Bnet NAND ont 3 ps NAND, é Di Bee: atie wd vain Sa i th te of 2s nd vail NOR o- ne ane togic circuits > oo dr lg Si agra? iLossany Be dicey cagrssie er aires va é Ts et oH a a ito Fine sy wry nc te -1y A hk Pn —Amodem oes wih ts he st of number © and aed cons ores Bo ears ns cet (eo 27 a oe someact ‘h word wich af shoe bean changed oad nee ae eee I pec ei ners peer enre: Renate ae ee ok ax blo on none Moser! m0 oat dengoizace aw of boolean algebra with the help ofa truth table wer cacccam nominee et are et emmenentte ur emrenetetaied Seer eee ‘eeignsotancntva norte ec me eco “A teehee oly non ct ave on sub 1 fof Booker exprsstan AD= CO AB fae or he Bolan fspreion (X +. on a befor he lowing equa: () M=N(Pe R) () M= N+ P4 NP15 Fie he dof Bolen exresion( 4+ B+ OCA FO, Find the dul foo expres 9+ C+ BA Fin ie dat of Roses expen XY Z0EYZ Deng get alin Bolan ition 9 : Peer eg di xg enn = y= AEDS ABET AICS amc D+ ase Dy anc Draw dhe AND-OR cit or Gun te Bashan atin AD CD + AB Obra the table ft con) Draw te lope ut er "pba the a able fh cin!) Dr the lope teu ra Gen Bsa ann (2K FRY 2) ip Oblates sible action) aS lng eat er Ge he Bosca anion (443-4 +) Sp chute rth te fhe ecto (Draw the ap el rash cic x tian er patin oe the np atthe network she et hat neyo is implemented y the teat own? Xf Gyaese Were (ove eyes (@nune ofthese “at fmcion implement by thecal shown? (aeyee Oureys2 = po owe gent ¥ {eysane ofthe eer ‘eat aes siemens y he cet hen ee Ben @my vey ON. Oe tet Beer ne ge ce Angra on express (9 (4° BCBG): A + RE ABE pl yeu uf luwogy let al serpin but what rps edo rate 3 which re rte ts iv eben nr Wea ie ls he ged wo decades ago, Today, you can listen to new OF play You favourite msc geting up from Your pace, by fst ging spoken instucins, Based on your recat History, your online shopping store rcommends products for you snd Surprised with thei hough matching choses, 0 ? AIL his and much mo Joos of mode age ecnologi a chapter, we shall talk about some recent ends in comps gy. 8, It us begin poting ad information