5 aca Introduction to Algorithm — Now conuider « protier of adding two numbers. To per ‘dently what we eure and bow can we perform i bBven telow 1. Sen 2. Tekettvce numbers, and 5. Sop = sou what wear ding is for even problem. we are providing spy sep proedre Feng The fond definition of nsgoritur can be sated as followsAn algorithm must terminate afer exeuting cermin finite numberof steps FS. Mectiveness howld be simple and clear Each step ia the algorithm mus te ible and deface ‘Byllabus Topic Why to Anaya AWgOrRTOT 12 Why to Analysis Algorlihin? Algeritims re about 1. Solving probiens 2, Finding the betier way to solve « protiers withou you know whether an algoritun is good or not For example, To sr the numbers, we have mi sor, gulk 1, merge som ee. Bur we choose nd speed consumes. ~ mcomputer scence the my algo s the deter Storage mdlor oer resources necessary to execute em. = 50, the chicive ofan eet slgeritim is of wet i ‘considering the folowing factor Programming requirements of analgorsi © Time seguirement of an alorthm. ‘© Space equirementof analgoitin, eee “Spes Tope Funaing Tre Aneta 4.9__ Running Time Analysis = be of me mes inant aspects of an algorithm ix how fist its Ik te proces of ocrninng tow peceang Unc inreaes or the sine of the problem inceaer (apt Sine, Input sie te mabe of elements ibe in than nt very esy to caleulate he enact time requirement foray sgcitim asi depen tee tou fcr ike machine on wich lors is be ecu lg se ‘and eps sine ofthe algorthm,oa ee aps meAsymptotic Notions are lngussts tht allows us analyte a lgorihn! rung ine by ening behav a he pt ee forthe algo creases = Wasa wo fnd out which prt is bets for the same pechen sateeny-B.Se Cory eed sympiotc notations to cake the Femng tine Pig. Chet: Asymptotic Notations jose aed to expres the commlesly of an algorithm. aa be defined he rate a which the storage or time requirement grows sine None a space requirement of the algerithon IF the agri i¢ more, ten compleriy of the algeria tof the algo is less, then complerty of the of the funtion. I maine the worst se = > 182 Big-omega(a) Notation Big-2 aoaton gives gies lower hound ofthe given Fuacion, Tite complenty eth best amour often algeritim pons = This means, a functive fx) i Big-O of futon g(x) und thee exis Sons ae ih at, in) >wexg(n) where > Oand n> Ith forall n>= mg tn) = ptm)fin) = Oxgiay er some ip ny the Flue ould be great than Forex, at inde and Botti Astni2> = in G4 an n= 2 80 fin) = Bplay, ‘ pi and gn tom prov that) =O). a)> = otgta) fora>0, = rey=aiany Mp Psa Notation operon ca the sro af an laos spper- oat, “Lite foras=1 eal Constan > 0, thee exit an inter comutnt ery integer > xa) Daido?) as tnx feral n>a2 and coat F185 Little Omega (us) Notation = Wetne notation o denote «lower bound hats mot sympa ih = We ay tht fn) x oso) if far any el const > 0, hee exists an integer constant = Lash hac fin) > gn) > O for every igen > ay,bere (WU 86 -Cimg) 1-13 en il be ical he sae es sigiica r ss for Finding out the Time Compleaity of a Piece of Code [ania se eysession lord Spends vp two facts i. am of exept tie cesuned on ey CPU. Faxmally they are Se emery i need to run vo complet”? (i) Variable Component Example of Space Complexity Spece Complenity aul. ‘escent = Lose pl eae 1.2.34, nes ‘wou rer + mabe eu res ~ fe above erp hen calling he mace compen we wil be ooking tx ton fixed and variable eommponens. ~ Bee ve hve ied compen el coun ab nv ieee luce equredethre(3) werd Variable eampoentscocriza asi value od ze varie upon vale ‘store in arabe i's 1).‘Time (A) = Fixed Time(A) + lstnce Tene(A) ub of ses iste most prominent instance ebarctrit abe a ich we iste tt abe of sep cen ty fi = ns Secoining be nab f tes por excesHeres = 3b=1 wd 4 0 nce Tin) 040°) fas. that means Te) = O12) Baanpe waais comes ifn is suficin) above ron, we cane he “The ast stp doesn't wot. $0, On VES) doce’ work: Wat ee ie bemens = alws prof are ln ee sbwee he connecting EDGE. ver i bea mina of 1 numberof edge. called w node, Inthe above tree A, BC is equi of iinet in wich sce ~ Thr immeine sce of amet called as CHILD Ne, 6 ss any pn nde can ae ay suber fc sve, ne sve we are childrens of node B, aie © sing ~ Chien fhe ane Paco ecw SIBLINGS. nine wis he mds win faeriren acl writing en ~ Tne ove oe, and ae sigs Dan Ee ings > Sues Abu a ne escent put le eat © Lastnose = ede ich do save ny hala LEAP Nae = Lat ode a eld a trie aden Indie toe te, F.,H Fare ea ae ‘node of a uve nt is soe or moe tlds called as INTERNAL Nae. ‘The root mode tn also sld to be Internal Nodeif ibe tee ha move than one rode, Internal nce are also called as Non-Terauinal sods, © Extemal nodes “The ea nares aan cal as External Nodes. nthe above bee. FG, Hy 11 ie the exter odes. © Degree of node fhe uce dan surat, the foal number of chilzen of node is called ss DEGRER. of tha Node, onl words he Depree of anode otal mumber fen tbs. @ Inaboveuee degree of ode Ais? (© Inakoye wee depreeof noe Bis 2 2 Inaboveuee degrecots sale Cis ‘a Inaboyetree depreeots node Es |.= The shove Rove inane 6 bnry ee representing Like lit repeat array (1-D Acry) ‘binary ee and i 5Sr ua Topic Types ot Binary Troon $n atop ot cay Tree 23 of Binary Trees ‘There ve differen types of inary wees ak ‘Abinary te ssl binary een wich ever internal nade should Rave ens tm children o¢ none Suicly binary te is used 10 repeat algebraic expresios whee pon-eefnes -epeesent operator ul eal pode prevent operand, “= Sbcty binary ite daca structures used to represent maherausal expression: FrPig233 = _lasbove ue te nodes which re represented by recta has exaelly 10 children that mesns are at same level is called Corsler Syllabus Tonle’ Properien trary thea a love i+, there we? umber of nodes ins binary wee of height will be 2°! ~The minimum number of pds ina binary tee of hight ns Hoe a Fal re 6) Complete ree = Numbcr of leaf nae ina complete Winey wees (s+ 1,72. <= Swacompere binary tee Nonber af external nade = Number of internal nodes +“all the nodes of a tree, Thre are three types wf binary tee preonderRecuesvlrot. et real) Time Complexity: Oin), Space Compleat: On) (a) Non-Reeursive Preorder Traversal ez NE waver. Th odes" valor we appended wo he Flin wavenal ier afrme sesllh:Tame Completity O(n), Space Cy G0) Now Recursive inorder Traversal ‘defies, es) ‘tot rc: ack= () ‘Time Complexity: O(n), Space Complenty: Oe) > 253° Post- Order Traversal = Tn his waverslvchnique the averse nde is feih-oat © Process daa ofl saree © eh travers right ube © Then, averse sone nade In pos-onic traversal, tbe eR satre is versed “the nade A. Ing of agin ther is asubuce with rot. Sommer omitae ofthe tre, a posible Solution ‘WN ia Covers Trg slassT neo, *Peonstucor slit (ef datas AT ‘Noe. neat None} Giblings) fom left right. children excep the frst child the left child and seco pier pol ects of the sheence of et and "irae i no ior > Wy do we need Threaded Binary Tree ? = Bioary ees lve oof waste space: the Heat todes cack have 3 nal pointers We can tse these poiters to belp vs inner eave, “Threaded binary tcc makes te ve avers faster since We do aot need wack oF scur- | soe for traversal. = Considers ollowing binuy tee (Fy. 27.1),1 Siogie Trreades Tea init i treted twas str te ter ‘Means liebe aul pone Predecessor or socesar (lf sigh) "il pont ores sccessor OR ll left nal pn Point to inorder rescaser > % Double tresded ‘Each node is three ‘cans al sight ml) inorder successor AND all eft ull pointers elt Pint to inorder predecessor owas both the n-ne Predecetérand‘suscenor (left nd ight) Poitiers wil poet. ie inary wee, tt find the inorder raven 27.2 Predecessor and Successor siti You doth inorder tava os tiny tee the Beghboes of pven nove we called Exstetemar tbe noe hes blind of given node) and Succser ke ack les ahead fe, ode), > Example Meat TA Threaded Binary Tree ies cg eee kon Ee Arr geeics Sidi ii ted aie UR Wehr nein oobern Fale A ily fost edo ined eealde init (ot data olidata = data"elec the oe with he soon ee root =m dats 2 foul the nse wr seco ddlete= You ee se gi tA fica wee AN of theif sabes ae emp. Becau Ota, ett MOM case cach ofthe opettions (lookup nscaion ed Frum te peopethe of te wort ak. ne might ar nels seach deletion takes time 6, ‘sing linked ist ~ That bad Woust case tebisior can Sometimes caled ave pare” SO Sided by wing a ep ced high halacng 2101 Height Balanced Ties 13 Tuo she eka cies hai © eG @ @6®8 nee |= We define the balance fae for ne a the teense between the Beh ofthe let ! sure ane the eight fe right ube ‘alanceFactor=beihileSobTie)-eighirighSubTice Weill define ance tobe talc the tance act © Example Ply 240.3; Tree = Inthe above nee, betanced actor exch node fa Follows (leftSubTroe) ~ beight(ightSobTree) BalanceFacton(241 = eis! . 20-020‘Finding the Height of an AVL tre Hs 3 eum Yel og alr ight ifroot = None: stun lee: Tet = slfeneHeighi eth ight = wolfe righ Singleton 1. Left eatation (LL rovatios) 2, Right rotation (RR evtan) ‘Double routions | 1 Let Right raion (LE on! 2 Right Ler L388 OOOOee, ye He tn, Ro me oon te oan ition oe Pet To oman LE Roun a a eee . De oe ett he Operations into an AVL, Tree, — © Gey’, > Q@ = e, oe Tree icmesienced i pot : ee tebaces 2 As a < se seen Fig.214 (b) Right Left Rotation (RL Rotation) a = The RL Rotation je pmaking A the lef-subtce fom the cuter posi = To understand RL Roto, fet ws coe ‘wate uae 7 (Rete seston 217 tiny be” Peter ston 2.2) nou yn lu tr secon 23)Graph and Selection Algorithms Ropraserzatis '¢ ctuon, Giocin, scpicafons ot Geupna, Graph Eebrsceniaon, Greph Tarwens, Toxogea Sar, Shovon! Pee Agere agen Spanning Tee, Paneetbe Algotithna: Wha aa Salon Aono? Selection by Sortg. Pasion: ated Selection Algor, Linear Selection Alorten - Median of Medians algerton Finding the K Smallest Elements in Sorts Ordon ‘Sylabus Tople | Graph Agontim sinrecueiien | 3.1__ Introduction = This chapter intradoces an important nonlinear ds stractise called Graph. = Ithas applications la various Geld le eleetial apd eletonis engineving: computer science, games and puzles, Geographical lformation System es, Syllabus Tonle: Gloseary oe 2 ny ea en oe = Wu, vpn ener neh snes eras, 4E the inks that comect te vertices.Fig. 3.12 -Undtected graph Phy 213: Directed graph = Weighted Graph The graph which nig edge is. a weigtad graph Vertexisalso known as node, Penta + Adjacent Where san edge beraeen verives A and B then bt A. and B ar sad he adjacent = Orgin Wan edges drt, fst edit is ail to he gino = Destination ‘fan ecg is clireced is frst endpoint ssa 0 Be origin of it andl Ue oer endpoint is said tobe the desiaation ofthe cd. > outgoing Ege ‘Adieted edge isi tb osgsng eon tsongin vee. © incoming E69 ‘Aiea edge i said oe icoming rons deviation vr, “ao 4 2 1 to be degree of that vertex, ‘edjes terminating 4 the vertex is said to be cigs sinning from the verter is said to fe i ‘then that edge is termed as a: ges are called as paral! ‘Adrecedacylc graph [DAGI 4 dace raph ith 20 ects. —_—_—— Syaabin Tope: Appletons of Gres oh+ Repeatseps to while he stack is not empty, + Retove u vertex sty v which sat the top ofthe ste: an shang 8 sate 19 processed and pushed wo the stick. + Initially all the veces af gragh Gare setuo Undiscovered [step 2: Change the ste of stating vertex ofthe ph to Discovered, sn put iin the Repeat for ll undiscovered veriloes u of verte us sett the status Discover oriied nodes omy ‘hack A ap ested and pot i fi we stack. plore any omvisied adjacent node ue A. Bas Sand D ae ace to Abt we are concemed for‘Step Lt Initially al the vesises of waphi Gare vet to Undiwoovered Step 2: Change the tate of sting vertex of he graph a Discover and pt tin the ‘queue. Step3: Repeat steps 4to $ whl the queue isnot expt, ‘Seep Remove even ny wtih ste toto be guewamdcange sate | peel Ftp + Repent for all wndcovred verter of eres et he ue icone and dod othe gueve | Example asm. (EEE z iste (here sao venen), Delete 4 of iil ae a0 rai a djocene °° ——_—ome: LEI Gel BFS(celt. 0) A Mask ll the vetces oot iad iste = [Fuse] lesser) | # Creston queve ex BFS leer 5—Spanning 82 spon ae vera rc al es ag adnoe envitenewe zie ast | ——‘igorithm 3.7.2 Wren aigorttim toting the sales ang Solution + el FinSaleiAaarms Design Greedy Algorithms Siratgy, Elements of Greedy Aly “oreedy Method, Greedy Appicatorsafer mh other in serial oder. These ae simutncously using treads. this on different machine then we cal with «predefined proces ution at each step through the = hae. lutions are called Exact problem, then we called it acreer mod er sear cay tuned oy cadeAY CHAPTER UNIT Divide ang Conquer Algorithms ee a ee ee 215+ 150435 4 165+05Following are some prob 1, Finding the maxim 20-2 s ees wing te vie a! SOON MPN —— |Syllabus Topic Proper a — M12 Propértios of Dynamic Programm, ae 6cing an te dnc rn he earn a wand ra vues care fm pe stan, ade conte IE sf iis wt me LSpe Bam mor oer a ade AV opm sei, LCS Length TaieFomuuns,