DSAT . Diserebe Structures and Automaba Theory « ? hss discrete Structure s 4 Et develops your mathemabient ne leg Tt improve your. problem sol Discrete mathemah es is very img subject like operating systtm security , compiler Coe Many grrablenm Can beSsolved ning disereke m Einite Avtomakn FA is a mathematical mod. an Finike s! My CEST) ushich gives The abstraction pide simplification oft how certain machine worles - | FA is divided into 2 ports ss H [FA with owkpul= - Fsm >| FA withouk output - NFA, PFA, epsilon NEA - Sek- Treory . + || Sek js well defined co ee odin ane | An object= can be Ss HS an iden : concep |—~_- ¥ wean obie ct: 2 Example t= collectin~ ob pews A collecHa~ 6 cave eeal —_ ; lement ot set | Any obye'c beloms my to tet te_tek ise alee mcane by classe crm od tt oh see: i LIfe’ is element dt set ‘A’ | AEA J rt ‘b’ is, Eds de set'Z’ | b Lo g vey ” a4 | Predicake properts fa | Ties. : | The elements are ye by ‘predicate which 's _rnexct comvenitnt- Han Vist aloe ts an odd pg t é If Pl) ts odd positive inka ert ten B= 4! Pooh |_on eis belong s to Set B ten -PCLY ho, to be tue- ani Universal See iso Ars ‘abl lyclabed ths lthouk ony aeptbtion of elements Tb is dew fetter ‘uv’ 4 ‘ \| ’ frem[ [eet Proper Subs sel- A proper «subset of suk A is ai swe sot aA Prodiis not 1 equal fo A+ Tw other wordd 16 Bis a propane: Subrol: SEA thin obt clementy df Bare iinA but Al cotajns 1 lot least me element that is not in 8 ‘ | a éy- Az tis,sy_ i e= tsy t a 1 BEA a c= t1,25y R ainda a = i : re : SEAS che AL presen olan z + ib) DieactR lgasag a : Operakion on seks, 1 8 tt oe lie , oe © Ol complemidu— a adn css fan Rp alte ’ This’ see edntain's aM ehement Bich are nok +H ino seb. , A's Lxlxgay ‘ Pz Properhite of Complement ee hs b A phe ys. Anan =$ — 2 (AVB)! =a Intersection of two webs 4 8 oe? | A intersechon “8 i's ‘given by! ANBLKI LEA ond LE BY | wu i] va Union of two sets ba Fy A A union 8 ig give byt AUG = LINEA ov LEB ev both} rT a ’ Pe | ry Proper hes of iwkens ectiaw ANB = BNA : [ @os)nc = anCenc) Asie b> sa | / vs Lak 1-2 $ OAH hj VAANEAZ | | al (avs)'= A'ne! - Sass Eit0y ang vans, 183 2 OMS, Ys N = C10, Hy eof ae Made te vic tro i, 12,131 15, FG ne J Que)’ = ALA! : ves C1, yes 5s "(Aves bey y t A’ns’= Bigs Soe " a Lit inkersection of tuo seky_ is} -then Trey are Bistoint sets T Le Ant=$ - oka Set difference . | A 5 Ba LEI eR ond 8 PN Eula A ond 1 e-By Ata -a Sv ion abe oe mete Difference / Avlaun B= AUG -~ang ge ;a i aera aA =r = aac a = = Poropéw ties Cf" Stmmetoric Difference ss! i 6 | A 45 = BAA ada | Aasjsc= AACBAG) | Adee A a ’ | .naazo — ASBR= g 2 A= ay . || Cartesian Prooluct® gf eb! O's st ae =tCa,b)laea ond b EB% | = (Es) 85 - sor ‘ eee 4 aye od ot ee “ Axs = :tl1,5).$C2 56) (3) 7) tbs ce Power Set - : € SPCR. = PRIX RL AY. aaa 3 Az fay ca) = THE Aig fosby.. ta) = © b, fabs Coie has aA elements, where aie a re. = ne E wuts Os SthS ‘ 1 pet pos i S Cee aki, " Mic = 0 ’ ™ 2 ; ™Tue proot on Ma comists of tree parts _* cha ata N Leb Pind denche oa shabtment> (a formula / theorem) core ciobtd wilh nz 123570, and ndtuoak, number , A b = Vem i Shep 4: fn) shold bentrue for. 23s iebe- 1 ag NS a ‘ ix fh Inductive ftroperty pare ieee Shep 2+ Assume in) -b be fue for ne se (thin we _Coun_ prove. fon) 1 #8 Betivies ster A bieat C™Clusion o~ a. Step 3:- we com tlw dee Hoek asl i i eS new a peovell by “si Pale ALP See Hee sedan STE | PC) = oR i PC2)2 € eis “5 4 \ Fs) =12 Pin) = atures * AC 2 uM P(m)ins = ens when ned DR 96k) = Ue = Dees esc, ..er ay = ————e [PCy = Del pepe 2CKH) | S es RiWes = Cert) (heey) = Ck) Cer) WSS He HOG. Zee aay I Sk C ke) + Se = Osa) (ker) ait L-wes = Riis | THs ster is te fer feel OY) Prove by Mr (ESO Moe. 05 (nen mead Slee FLD eng = POD ene 2 PCun = PCD ews OE) SES 3 eS (Cs =) Pes lee IL Pete +19) Beh tise A aCe ae) = 4 8454 + (2k4)) ke = (esi) = Keke = ee ea Eric +) ipnae = BR 2 e+ 3-5 4 + Wnge = (ns) (2n+7) © a te) (7 =3 aes. Ds epee t+ + k(k+r) kt) (2+7)C60 | een la i OM — Pbeer) (4 ike 1) ofesemuey ome etme — — [GSP 2 ee ee) (Uy z= Key) fated) + best) (k+7) 6 dl = (kb) Coker) Coe eer ees 6 = 2 RE oh ale ce eee Cre, é 3 SENSIS) eG be ee = 2h? FIT + 81 HIE oJ, a POs Yeuc = (ets sero) Ciena) e = 2k ako eb y 1g © PCk+) = Tee J “|S emue. by MT win Peni diieuie ve sea a) = 42 ee t [ pz) = ee en 1 Gi) = ke ! Pict!) = (ko y)?+ ole nny = ie = | a +2Ci+1) New) Multiple S 3ay] Prove by rr 3" -2n-1 is divisible by & ey pes a = ° we ror) = 4-4-1 = we Vo oS Ts" awe Pie) = 3°. 2 ual im Sake = * es = =. 3 (38-2 -1)+ ek = aos ee eas Mukti ple. fe& oh i + | + SH 4s s aL Ss 3 ob Q Br < Buyu a ? IS ieee ares oJ 4 |i ‘l 3 : y 3 4 eee | st 4 is : AF rales a > aK EJF) |4j)4 | > S| a 3 3 J] pele 5 a | “| qo} |o "a é)2) ala) se 2 ?fe Normale Prem Tes Hye =) Dittunctive Normal form Cpne) Oconunctve novimnl form (CNF) | DNE tA>s5 BY AVR | " AeoB = t (~ Ave) A (Avnpg) AS eS CK r)v (eA pwr) As katomentalmentte? i, Walene een dis ium chion bob” Conta cio. is _cabhed as DNE e-4 © (pa ~4 nv )y (~4_a wr) | Op LCN FE A saktntnt (cm vbii eotista of conjunction bet” d is called as B CHEecu aaa 7 Parole Procedure to obtain DNF oO Replace p24 by tte cai Lewt: pve orchyza | by its equivlent= (op va ) A (wav 4) ow (~ p a ~ 9 a a) © Replace © (neaehion) before. coon ium chem cts china by we “de morgans Law” and manag eee Mp ie ® Apply oli hn Lichaicesta 6 Te ee) Conjunch Non ror mn CCnuS) A statement form whieh conmmasts of Con junction bet” disjunct is (NE ~ COVA > ~a)A ve) 2 (27 =e A> ~BAeC (YA WE) AVE CrA ng) ve wAvc)a Gvc) @ ol p> )Vlr> pd - =| (xp va Dv (ov vp) Ei (p va.~ 4 Germ) Cp viexvp)] alway torvp)] [t view) v(pv pl A [ry vev jv Ova Wa) (opvenr) v PLA Lila ven) Cavey “J ay (vasb)A (a <= 4) a (av DA[Cvavb)A (avyeb)ea ——— = = — Enuivalence Relation A relation R ow set A js called equivalence relation if itis | vet lexive. Syme Pie ond yawibive Vek AS eee Eyal nee K= £ Cul), 2.2), G, 3) COMER Va ncareomtere yt) C3)4 By || Lek R be a relation om set of weal no's such fot aRb iF ad mly if o-b € Binkener fT _K is bbw equivalence wrelotionw 2 Ler a=0, bzo0 See! SE (a, eis reflexive Symmmelnic = Th (abr eR, Br b-vder Ep (ae z ety (b-cDez Bye = ary relation on eel of tre inbeen ors aude fab) | (a-b) is odd te inkyro. Portinl Oveley velar A relation Kon sot Ais cabled Parbiol Order Rebatiow if iF is Reflecive | Anti Symmokrie anche browns bie Portal ovdey fet The Sek A, toa eller with ponrtiall ovday velation 2 ts called Peeks ov Woser) denoted by CA,F) Hasse diagram ° d The digram Of POSET Can be Consiclerabl, Simpl gified a» follows \y| Since in POSET Ris Reffexiye so remove looys orvewd> ver licen 27] Since in POSET RK is Trowitve je. akb oeJ8 bee Ho aRe Le drop Age from o toe 3 Finally germany e Hare Atosrann suck Hot all ores POUT wpword the drop pvwow head » Define weletion Rion set 2 by aR jhab t hem —nigalive even inkener Verify “Rif Kis por Hal ; q t + we laAton - Reflexive '- Vo € nonieve even, inkegen Caja) ER g ZiT =o ¢ NOMS nen eae ees Ankasymmetic i= it (anh) A (EN) tion a ob Bi 3 = Bees ce oe £ o-b phe -ve even intaw ond bo is abso i, oO ; + is possible ws aA=b——|} Ht | Transitive atlabin :- (aR) & (bRC) ter @ke) £4. O~b =2n, 4 b-c san, I OS Ne = alae) q a-¢ = 2 (n+n.) | R= Treamitve = [ POSET By, Comider Az ¥I2,5,4, 8124 onl Hu relation of divicibiliy i i je: aRb if a divides bushi me denote Alb s shou that | (A, 8) is pesek= and conatrack dingrnph cf Poser ont || ese ogre Co — || ate prove Posey:- | @ Reflexive | A=f 12,2424 Re £001),02/29,03,3) G4) (C22), i, Gob) Gy) Cee), Cha) 3), a), UID Y R= ale mustbe reflexive 4 alo 3 (2), 2,3), (6) Us ih Rb) ACbRe) thin (ako) is braniHve | sc (AR) is Post.A Ey Remove trom ive edges | ; a 3 B 3 eS er 43) 8 g J) Nga) |i is) | Ne F ag N 4 5 : 3 a] | 3 3 J | a] dé z é 8 é <| - = a ;Draw the Hane diagram for y Dios (dinsible by Sins) ee ay Dar Cdivisible by 12) and determine the maximal and minimal elament - Lowest Uppew bound ard Greatert lower bound os a Dips ie 1 1S Ly ps Maximal :- jos— 3 be J, Minimal i 1 ; ‘i ae new — 20 SieaeS isrelobeol to olay elunevk ( Cobled minimal lament Tn ow Poser if on elimat is not yeloted to. ony oMey elenmet is cabled Maximal elenint -Howe diogram is collet lattice if ib is mek beth mee semi awe ond join semi ot hice ny ES gia leyea tg aol Puy es tuglx~» £ peRe Gale) _ = Lve Gf) = 9b (GH) = C2.) ap Eun Coral = B , Caf Cas Cadye xt EB ond UVB exist fox oll hon -com then He sthucturve is a latticeModule 2 - Funchons theory _/ . Ie" eae Functima = Le A anol B be non- cme seks. A_velatin. fom At B such tok to every Clement a HM Pxe. corresponds aw wriaue elenet= Lote is calle a function f fom Ato & f: nen T The tlement™ a is cathed ea tre 20g arnt ox Poimege A rtlation ot cet js called Punctinn if tt follows some f Pi Bot cae fp au Every element ‘a of A’ there correspond 5 a wig wt i Lelament b of 6 At A J) JS \ ox function @ (onto) funchion (one-to-one) fun chinn (bot me -to-ome and mo ) functineLs <= ——. Gi] surjective function !7 A _funthon €:A>B& ts catted mto ov surjective if eve 1 i Ee ! || element 2 b €B is an image of ot-leant ons clement at A 4: z | b See oh aD | Gi) Enjective funch’on 3 A function f is sail tp be one to one if no two chmat Ht A ove BoE tp same elements of Rp ~ >=) p=) : = 03 JAI Ss Is) Sy Tn each care wheter fanctim is in jective. oy_note a Oi) ay ; & eeite OS Dyed) Ay OFf= flu), G4), 0,84 OF: t{la), ,),03,4)} é ® f= PGES), Ce ew EE @ t= £04), cay¥AT ennai rat) i ca : t 2 | one —to- ome Baia. | a rey 4 | [2 bb | | \s =] i a er | x @ 1 a sa b\ Y te / WZ i Not function - @ {a see Uae x Ls a seq weit. in which bote edges and vertices can be datecode vepealed 3a Trail This a oven walk iw a butt vertex con be repeated » Pate MOUS Te tral ih udich neither vertices Noy tdger ave ~epeabed - Cycle =A pot in whidh Pik and lost verticn gue Sdn | ie Type grap 177i] Compleke Qeaph “A wap lh tw whic ci pale soa vert ces fei pxractly one tdge = &, =) me ie 2a thew & ins loop pa & has no multivle. = + (n-1) Z . ear of eat vevkex = (n-1) War ganpl lar grenh is a eek. Soma A pope Hemera hag ate & a pe)aL. opie: Graph = [A grep is caid to be plonmy if it is possible to Tati as ‘ Es ee ee Lverkex i Fe La B | ae ia pe = Aetie pate @_h ewler pote conta cach eye. of & exactly ure. | ond vertex of G atteath once - a 6 — , oe [Bader Pocte = d-c-a-b-d-e e- a-c-a-b-d drum i= a-b-ed-a-4- $2 Soe Co| Hamiltonion path = @-d-b-a-c Hamiltmian ore tin A how Fone crew that beain ard end at some verbex a I | > = Db & ae A= ¢-F -E-c- p-p-4~ BY pS is said-to be Hamiltonian if tb cobain eae vertex of & exactly, onc é @ A € B : a: ote - & F degree of eery wevtex ip en, Han iF esl eerN AAA \e\s\e ee ee ee Two graphs Gs A Gs ort ssid fo be isomorphic if they satisfy the followin, ue aaa there. it wn. ver eth. Troe will be ai ara ot cha gare S24 uenct. a Xnci dence welnbiouthie Loox eal See ae pes owes ote — ome - eq: oa 3 aS2__FrA_syerming_tees Sf the Following grayhe The ae haa = 4% Fee sparing bree = n=! d = Step ti- Remove sel siete a S > Step 2 i remove ey — — So SZ 2 p= pees ia... ;a flr — ar | pj keshre Shotet gat AA? Find _mirhkmum ee Aree “Por following W_Dy'- Algo - Wei aU labs _comider verbex” Bas source wart Ye iia! a 4 Ae 2 Ea b cost(0) aa essere cB) to source vertex and 00 to all other vertices Ps, minimum cost. neighbour for “te selected source | verte “Mirtmure Bot eure cot sot co vecbex, Minimum ( Current cot ot , cath + edge value ) pelgiibour werrex een vg \\\ SAMS: b> acje AS minimum( oo, +) => aC *) C= minmum(eo, 2) 2 acc»? e > mininum(,5) > es) Select He vertex from source vertex asin minimum Cost value and which is _wovisted ale b deal to} ets] = ek & = minimum ( 5) 242) = minimum G4) => ele = minimuen (0, 5) 9 A= Bi tenis) Sodaw immer Sy see) = eet ary UE Zo? 5 7 z diy et | = 7 NX Zs 10 Mei rag 0 (eo) eer A OI min (00, 044) 3 1> min(o,0+%) > 9 C4) 13 @2,7 3 2 min(S,| Sa ee Finite Automoka:- An automaton with o fin'fe number i is cobbeok a Finite Automaton (FA) oy Finike AT gynke_ Machine CFSM) i ath 4 i. b. S-tuple (a, =, 6, 40,F) —T iz finite sek St stakes Ay igs ibis a finihe set of symbols, cabled te alphab& — | ct tre atttomaton Sie ibis The troiten function Ee ‘vis the initial state from where ory input tr procesed (90 @) | Falk is cot Of finike shutef / Stare of & - eg - e IN oo =—===O “OS Ee t er, 1 _ || @= tasb cd ° ! qo= tay — ai [fas | toy fic Y b [eex | eat 2a by | EchFind 5 tuples ("= ta,2 [oom T l= /77~) SS Figo FY) ond taitign tolo\e - ) Find 5 _twele no tabi (m=f6,2, 5,49, F4) ond Dom toble - ° ° AM aioe yO)ae [ey a) (ET EE W oO ) Serene et So ais r ot Fst ee \ Lerguage acceptance by tinke automato A_stong (x) is accepted by finibe automata mz ta =, § ce Fy raly 1S O@jinn oe) = 2 fhe cca Pin F The longuage accep ted. M uhich ic dunoted by LCM) cep pene ful 8 Cae, e) is in FYont 177 ~/ ——— sCq, _ Noir) § Mons yoron) Aw ha e101) | iat. pe Vout) taser. os) | & (4 (43.0) 1) r s | § (a) j RoRC CMTE MN Olot wil) be Accepted ss OO nada, Se & C 4.0, 11 e001) em S04 1) 1ooo1) | 6 C §C4, 21), 0001) C : Eee 2 |) me 5 Ca. £5 en) SC 40,0), 1) ray ghee will not_be accepteo by f automata Types of automata - PFA “= Dekerminstic Finke Automata - NEA/NDEA = Non- dekerministic Finike Automate - | 2efinihow of DFA: tae term DEA vefeve to Hu tack POA each inpwh tek there is ome ond only rake bo hie cutrometo Can have tranitin frow jf, cure| Ss Design OFA owy = Cowbuck of DEA that Accepts inpude Os te thee exits with *\\" mA S28 2 1 EA Ean romDAT Oro oooennd Design a DFA wh_ve S= fa, by Starhing with prefie ab d