wbich ef the followtog 14 O por! cf algo? @ An et she avove, Whar % the most desimable, characteristics st aN algo? © Ability to Accomplish task which fs not ebsentiak charactoutics of algorithm ? © efhfcfene, Tf fn) =9n+5 then fin) id @ Ow) Which of the foitoding cart be Solved by Fecursston? @AI of the above. 4 eae +] What do you mean by AIJo? write the chanactotaticd of an algo. An algo is O % well defined Requence of Ateps or instructions designed perform Q Specific task or Solve @ panticular problenn. TE can be Qk Aimple as recipe for Cooking noodies. OF Q, Complele 04a BHI of operations used in mochine leanning to Analyy large dotaRets. aed mite predictions. Chanacters ties of an algo ? Clean and vnombiguow. > weil defined inputs and outputs, mame Pantie > Feasible in Language tndependent . ASSIGNMENTS -ie S rok required to with thy thy Dieu aaymptotic notations in brie? The efficiency of an Algo chpends on reso Crecute the Aljo » The efficiency ts measured Help af Qaymplote rotator’ . AM Age may nok howe Kame poiformance for different 4yps3 f frereare in the tnput Aigo, the performance worl change - ° Mathematical notations ue uted t0 geseribe, ee FEMME dx towards A time oan algo where tht input en Paxtfeulox value wWheseas in Fnput annay % in Teveue | CondiHon 40 that vill be work Care .when the tnput Ovvay 7s nether Aorier nor fa une reveme orden hin g Agympiotc input with the HS Qvexage Lime . These porated ae wed | UN notations. TP $in)= Jook ght dan ,then show that fin)= OL"). , To show that fi») = 02) for / fin) = t00-2" 48 tn woo. munt find Constant C>0 and a Value no Such that: finyec.2 AF No Steps, Tdentify the dominant eon €x ponenttat growth domiras polynomiak ang Unea growth » 1o0-27 1% the dominant tum. Sep2. — Ffnd an upper bound. tn) = 100-2" FNP +n nd>2 and n£2"NE ne M42 25 on 4Un) = 100-0" nb an 4 loo 9249-2" = 109.9" By chosing , C102 & 1220 finde 0.2? + N>2No 40) fine, O02") Solve the recurrence: TOn) = Tint) +Tin-2) 41, whow TCO) =o , TU)=1- Stepr. Avive for amalt values CWey= GIT WCC) FMM PA og 9 TO) a TO) + HO) the 2ei14 -y Tluy= (3) + TMH = Gsron-e4 TO): Tay 47) + 5 eeSEES atl = 12 7 y= Mi ee 1D #941 = 20 Sep2. using chor A equation , voe solve homogeneous yecurrence. Tgnoring the comtant tim C41), the recurrence behave Like: Ton) &% Tin-l) 4 Tin-2) The choxactenstic equation is. ur-u-L=o Ju. 15 Y bo, d= JANG p= ie A 2 Thus, the genwnal ‘Solution, Tin) = Ae” + BRPee ‘XN Siep3.. Solve the particular 4olution free, the OTTMInaL recurrencl: has a" + ums 2 a tonbiant Solutfon: we Aum Tp ln) ¢ Substituting fr the recurrence: aa cit 5 C- Ceacat=0 y > -0=\ -0 > Ce Thus, the full Solution is Tun)= Na+ BBL SH#p4. Solve for A and B using initial condition, pe mco) =O) wa Qt mo: O- Mies eo: ABet aa @ 2. Ok ney: Iz Ak+BB -s AL+BB=2 gy QFRH Substituting, we gee: Grete Gk A pe 2c a-B Bek Ofte simp Pica don: fle SiS | O. IE to 0Pe FS 4 ary RRS iit ml cra tS le 0 a aa olution Tin)- (ane Ja" (353.) prs Whorw, ee ENO Ea | ENG) we 2D ' ream The recurrence Ten) = aTCnl2) + describe tw eed | dime of an Algortthm A A Competing algorithm A had O Tunring time Ton)= OF niu) th. what %& thy lange ‘ , \ A integor value fora A in Asymptotically faxter thon A? * P| osteo SHp1. Solve for Ten) for adigorithm A using tne “Theorem The recurrence for Algorithm A ihe Ttn)= 4 TOnl2) +n? ; Léing Mositr treorem Comparing 400) with O Cnt ) - © (nee?) log, 2% 23 Qnd, ftnd=n? $0, N= OC nl*84) * n? grovos Aloudtn than m8, the roster theorem : v8 Bone D (nth?) - 9 a)aia tt eF ke DAT i ko. bathe Siepa. olue for Ten) a Algorithm A ‘ Tun)s aT Un]a) 47 Usirg masies Theorem + a:a bry finden i Now, wo Compare fin) with Oln'*8%) = O(n). 1. 5) lg,0 >, yon Tin) =O (Pau) ane Th (yA 1, then Ten) =O (nwoyn) 2 TF) ORO A | Wn enye Ob. Gay Siep3 Find Lagat a for Anymplotfe Comparison woe need T’tn) = O Cn'*84%) than © Cn), Thus , We require : (09,04 2.8 TAKING posses of 4: Qayxs to be Asympiortealty Amalie ‘ 23 > PAG - 156 x sag GO mast be Tnkegu the Lovigest Porsi le vat of a 35 50, [a=s0 |\o. Aris a pla. theorem & explain with Auitable exam Lorre Master THY method providya straight Poroard WY tos tecurrence equation of form Ttn)= aTCn)s) +f£0n) wWhow , QD}, br! & Puncsion 14 fen). Com BES, Seovection Sort» Menge Sort , ekC- what do you mean Algorithm ? Grive TH type af an algorithm roy to required by an by analysis or Complexity at an ang (ae: Analysis depimnining +h amourt of resources, Citme & Space) Ql gorth™ +0 aplve Q problem. Time Complesit i? D gq SPAC Complertty:- Pleritys- Space Complertty refers tothe Ormount of memory required by an algorithm , including input Storoge | quatiliany storage , and function call Hack 29 SG a recursive Punctton for factorial 15 Ow). Eyplatn recursive Sunclons algorithm analyis voith an : 2rample- A recursive Punction ts function that cal fexe to solve Q Amalie Subproblem. eg Fibonacci Sevier using Reourdsion. 2A NOUS eee WAC 6 aca The Pfbonoced Acquence fs defined as. ae Furl Tet UDO TalDe® 9 GSMS algorenm der, fborece! wing, Renato. Function Erberacet Cn) TR Nes". Return O igen genase Relurn | Ene : Return F’bonacd Cn-L) +4 Fibonacd (n-2) Begin: Read n Print Fibonacti tn) End+ TRE recurrence reyatfon for Ftbonacey ih qin) Tenet) +T0n-2) + oW) + THYs expands exponential ly, Leading to 0l2") time Compextt 1Dnich is ineFPFeient- ORES approach: Using Dynamte progra © Oln)- moenfing reduces the Hime Complex ity How the performance & Algorishen Can be Analyzed ? Explain With example. Peformance einaiysis helps deteimiow how efpferently an Algorithm runt in wims of mes and space Hey aBpect of Analyys on 1. Time Compleriiy : Deleumives exceusfon time cs a function ot Thpuk big. Z- Spach Complertty . Dedenmtnon the memory wage st an Algorithm. 3+ Bast awe, Worst case and Qveinge cares: * Berk Cove 2 Minimum time joven * woorst-CUe =: Moxtmum time 44letn , * Averagu-CY = Exoecltd tPme oven random inputs-20. what do you mean by recursion ? Fypldin your ON example. Reewafon th a process whee C Function call Lo Aotve smanen twitanew of tne proHem. Examples Factortad of a Number foctortat #3 delined a+ Nl= nx (nt) xln-2) x..- eb Recwuive Punction for factoriak Funston Factorial (n)* TP n=O MR nL! ye Bie: Return n* FO Ctorfal (n-1) Begins Read 0 Print Factorial tn) End. Execution steps For factoriad (5) factorial 15) = § » factoria) factoriat Cu) = 4* Pactoriad (3) factorial (3) = 3» Fachoriakt2) factortad 2) = 2% facroriad (L) factoria® (= 1 answer with 4 to TO43. Ne Times Space Comeptentiy +The complexity + OCn) + Zpace complexity + Oln) Cdue to recursion Aleck) The recurrence TEnY= ITCniB) +n dosertbes the TUNning time of an Algorivhm A. Anothen Competing algorithm B has a Tunnting time of Stn)= O SUAIg) +r? . what 7s the smahert yaluy + A Auch that B fs asymptoticaiy foyen than @+ Algorianm oo Ten) = ATHIQ) +r Algorithm 8. Sin)= a Stnl9)+n? We Wank to feng the Amaiiest value of a duch That B fs Asymptotgeally faye, than A- SPL. dove for algorith A ubing the Masten Thoorem The recurrence ih ef tne form: Ton) -aTCnib) +Ftn) Whiw a=9 b=3 Fin)=n2 vaing Marttn tneorem, tony on™ wim ns logy? ae 109 S 29927 | HQ dominant erm jsn®. Tend=O0?) /du. Skep 2 Por akgortuh 8, tha recurrence is Sen)= A Stn/9) + ubing Modttn Heorem , loge <2 2 449° O31 TRU, due loge value coh a Por which B remains Ady mptoticably farter *han A ih Bo. S0lve tne Following recurrence + (Q@) Ten) = Ten/2d4 Tin/4) +T Cn) +n Expanding dhe Feewidten reCwuience, Ju) = TCniz) +Teni4) 4 Tinlg)-tn Expanding 2aCch 4m : Tennd> TCnlyy trie) +TCnyg) + n/, Tenpay= Toms) + TEM) + Tin, + nly Bach level Contribulss nin sora: towel Term Contributor’ D n zi nh + Ny 4ne 4 ny nig + M16 Summing Gut the Conlitbulfons ,c0o get : TiNd= n+ NJo+nly +njJg 4 ‘This forms Q geometaic seni Wehr burn: TW): OCn)NER ™ 3. | WhOd Ps recwusion tree? Dexcr?bey dole the following » by recursion 4r2@ method (Q) Ten) = ne TOMI5) +7 cunts) AN: SAP}. Undwusanding the RACWAion Tree, A recuntton tree helps visualize how A recurrence breaks down into Aubproblems. Expanding e Ttn)= n+ Tinle) +ThnI5) Ak 42 next level. T tnis)= (n/5) + T (nis) + TCunjrs) T Lunis)= Cunis)+ Tlunjos) + 7¢ I6n/25) Each [evel Contituts 4 dnp total. SeP2- Depth of the Recukion Tree, The recumion Ap’ when AToduct to 1 . Let, 2 depth kek: C415)‘n = Ting 109 mB ge 95" ‘ vohth 15 0 Ling eny) Ng dumming the Contribution Foch tevel tontibuis n,And thine asw Ollegn) kev, TOHR time Complenity : GY be ae renzomy Vf \\