a ASSIGNNEWNT- 2 SWromHik, ny 202IP ELC 7 SOFTWARE, TESTING: anp me: CCl wy AUTONATION PART-A ey what WY te PUrPOM Of ust Ob jecte icin ih icedion | in the Sobkuar Usting prowyy : > clanipy tosting gos and diliverales . | > Ensunt aliqnmunt with projet suguoument > Glucde +¢Est Planning and susounte cu location. | > Identify potenticg tis ting challenges ond risks. ~ Enoble effective ust musi and monttexing, Oy) what att tutable xquivement 2 | % They ou specibic , clear and un ambiguous Kojt wane wLequivements thet can be verified through tasting. | « Thy providk a clean undurstanding af wha: du softwere should do, enabling tutes to dusign and execute tuts to Vediclate Hy Aoktweous behavylL _———$—— i‘ st proudurnts xplain about They ane ditcild , step —by- step instructfons oudtining how to execut testis, ensuring conristenay and nepvo duc ibility. They yovick shuctunal App roach te sting, cover ing . > Functional tut > Seanity tt } > Pryormanct tut > Ricpussion tt. (4) List out of WA commonly uted rn model elniven Gt Ausign => Finite 4tatl Hachine moc > yMl Atat machine mode! > deciston table modelPARI-G QO). Principlo . of challenges of, path bosting * Path testing i a method thot and +6 duaign He KET coms xX Tt & a shuctural sting muthod the involves using Hu souru codt of & proqyam in ovdn to find every possible: executable path. x) This method & Asigned 4o execute all ov wlecttd path through a wmpubr program. path beating P10 UL% praw contol blow graph colantoce ayclomottc complexity Hake sub af pati cuatt tut cars. principls of path tw ting: a) Uonhol flow cyvaphes « ‘ A graphical suprusentation of programs control $0, Ahowtng Hu Mquune iH ptaemuts anc contol Atvuet UM,= ____@g (2) Poth iolunti (ication Tden tifying all possile pathy tvough the proqyam /: including loops 7 condittonal atotiments and ¢unction alb. 2) path lection: selecting .a Aubsd of paths for tating , baxd on factors Ute rok, compl xity and priority. (4) TeAT Can qenoation : wuaking tt cays $07 each acct path, ensuring aciquate input data and expected out COMM. (5) path Cov mag + Miasuaing tHe prantage af paths erewuttd during twting. challengs of path tusting a) comp Weity : Lange proqyams have exponential many paths ; making exhaustive tsting impractal. aBY TIML- consuming: Testing al paths can be extremuly rime consuminy , rUQuivthg significant rsources (a) Roounrct Intenive Path tuting clemancls substen tial computational ssounus , mimory and prounsi(ng pow (a) Dipficeatty in identipying paths complex conhol strutuy make path identification challenging. (5) Path covenqe miosxuncnenths Acouncittly Nuasuning path covnagy con be challenging , Upracially in tomplix Program ©) Heintenance: pedth testing HULU 4X.quunt updats to accomodate chang in the pugrams onto! flow. () Tert cok gqeawraction: (uating efhective tat cars Or «c (aU; equlying coxgul input cledag Fe ny oy enampt « ¥ Bruny Value Teng ok Om 2F The pepatan Seftor. dating mechanism 1 bine chuling 7 alata wb Gere sored fn bourclory values . The back bon iting stabiey was Idwliad pp g Meabig. aft €quivalyre Las op “heating why. pth, Paatilia, & thisos Habe place fist“ Pollouseo! by a Partibin ot he beundaiy _ \ \ Example : Conia Or ATM mode pt plore ee to wittdra Cash wvtit.s A bpuspre range Boundary values : * Minimum: £10 (Awe beurd ) “ Mantmum: £500 (upper beurd.) * Supt below minimum? £9 ( mvadiol input) + Twt obyre mautmum: $50) Cinva Exod mubtobs : $20, $20 .fost (OD Valid uppus : 1) wispohow $0 Cminimum) 2) withdhoo $500 Cmarimum) 3) withdraw $20 Cmubtipte 9% $0) 4) withhaw $300 (multiple ef $10) Qnvolid inpuds : 4) withdwe $8 (below minimum) 2) witha $50)° [ dbew Pr) 3) wid $n Cnotr a muliph 12) 4) witha $10 0 negative value) Expectis) Peoubls : + Valid Lnputs + Succorsft Wwithabawal * Favalic. inputs + Fryer mosege 01 dlelined. Aonsaillen | Dinpotones 4 Bourdlary vabus texting i | 4 the ie plow Usher thw huge Numba | of tut tars - 4 qh abr elps iin dleizcting mrrre 02 Wot! the beurdariv of the partition cthad i} a pl» peut as mot onrer acces at bouncy -G]) Giylate sown tio sting olth Pramyols V Data Plow ubsting ba yp 86 Bhudwol sting . Ss a metiiool tthe is Weel do find Be Det paths ff a progarr according tn the tiliors of biinttions anal Ube Y yartabl, | wn The prqvam . (Eb entre Wave * Stedemerts ushers Variable ‘reciim vals, | . >) Statements ufins che vali Lary used | BA Suefrontecd . YP Data Plow Testi 6) eo eee : MY dhe parm Gennes) fox alt 5 ox pe Vartolds, ‘A SS ae thergiat dole iru! hig ii) Tost oft uses: 3a Fromple + Vs ead X45 none 2° if COS 3+ a= eh ' 4: 0 = iia 5+ prrka; Lovie! flew geaph & above onampke - @ @) Bon ® ©Advrordanes * 2 To ford a vartabh tock vis Wer! tut proper 7 fd Waninbe ted is ds ee