fz Chapter = 1 Bosics of Software Testing 9. its methods - /SorrwaRt | testes | Sofhuare Testing is the tethad of verify ing a validating i “Ofluore application ubther if eo techina! requirements o Sl i design _b- eee meets user i offectivel ict Batenlly by handling all the gi crises OBJECTIVES oF _TESTING= Ro _filfil all. the requirements of _cusfomer _ To find out: the defect. or _ issues SL cite ring in the application before it is | encaubfere d by the efi use: i}To evaluate the cverall perfortoance of ___ application lTo___fiod __defeck which may get ‘created _ Ir i il i thei < fo prevenh._ defects. ataliapilventii «lalslecl pili lle bag4| DEFECTS _, FATLURE,. >| Nefect= Comme cay nefss bain os fe_with__ software produc s with fs_—___ extemal behaviour. or —ith | its infernal _ features: =| Failures the incapabili of a. _syctom to conduct el ae “lead within __cfassifted fanchicin picemanl: =| foult= A false, wrong step, — processor dota init ia sfc procluct- =| Frrar= Errors __cefer: fo a__missing _or_wrong. action “re. in certain fault Lohg injected idty oftware « Frrot also include a aeeeies| h i misinferpretetion : =| Miskike: -Mishake is on ‘income cf result produced because of human acfion XI TEST casr= Test ase refers to the cactions__requited eee ek ifi i dona li in soffmare to ting . ; * | Objectives : oil Te it le ct.Pago Nor bate: ——— Verify oftware __meefs_uset__requierteale= ___ iii iu) {Improve oftware qquuerlthy - = Is vinimize mointenance_£ cost af sofuace = QA Test case Formate 1_Test cacen Td | Test Description Pre = Candition s Test __Data * 2 ENTRY _cRITERTA AND__Exit CRITERIA: When fo fart and when fo op Festicg . Entry Giferia: minimum ay or the ! minimum f eonditions that hould be __ meet in order to Loar the fesfing work. The typical __enfry __criferfdls-rnoy include: il A te hardware, plalforms must have been ___ vecessfuly installed _,-confiqueec! _gnd_finetioning — operly ii_AW necessity documentation ,-and_ requirement a information should Ge available that willbeDato: oped era system behaviour = —* Exit: Gig —npimun lily ae ; ader__fa__dere_a have been run. ean ; C) tester iL!_All the test plan. iA corfnin levele of requirements _caverage has been _achieved - itl|_No high priority ar. severe. bug are left open —sleamas aug —etntemeae + |Veri| Ficsfion= = is hh afoul work _ product: of SplLes« to check if we Ore creating the Fina) — product « 2 | \ofidertions = |Nolidation ie the proces: of. ihe foal StdQ page No: ata: =O +1 V- Model = r also Jenowo as ven fica fion _and_Validation model. ae | j—freparali = {fanaa tet ce_fert_oxecation Gntheri System ‘fesstentoti Systero ma Regu 2 a [labal Dasiqo| reqralian ye] Netificafian [opi] -! phases | nit Testi i 7 | i 2 cutin, Genes = : Lioplementrtian tanita & | METHODS OF _TESTING= i-| BlackBox 5.| WhiteBox | Sortie 4. Dynomi 51 GUT ELTr | © | DyNamrc _TSTING= ll the soffwore __is__ executed with __veriaus input and tester compare outputs iyith expected. behaviour with____this__method- ill Tt follows validation _-_activi ty i £1 WHITE ~ ox _TESTTNG = iL white box ra is a defuiled _« investiqati va Jofemal logic and —_shuefure i ia all Tt i Helle) = ne glass-box festing . open=box basting. ee (int_o_,int 6) | int result = eh; Tf (esult >g) print (**Paritive” result) 7 3 Ebe —printl “Negative” result) 2c) F :r ear ® L z £ 8 Att is the _mast | revisw typo. 1 i mn. : formes jot ng _inspecfions are prepared: and__checls dhrough|y. 8 by __vevie jouer» | Tt is the fafie | teshi | ia qiinide a manner between ns —Gioxip, of. peets.to review and a fool | sa 3 2 | Technical Reviow= | If is less forma! tevieu and _# is | techni i Th o9e q testing af | the froclare of eystem or components | if Situctura tesfing Fs offen toferred to__as in bappened in inside the system (applica fronPage te 2 oan: 1 4 * | Code Coverage ne ae 414 Progen tefenenks £_line coverage: : ill_Sock of Activity. no} tt _ ii] A includes: actly murt requir 1 the - cod knowledge , loop _, iteration, fe - 1) main() _ odin} at, n2.n3. 2 te slif (ma>=n22Bl m>=n9) ee in famert number" she #2 n2>= ns) 2 es gis the largert number, 3); iN To stufement coverage,» _ fofal no of fine 1G. 07 ny eos Ne. of ine _execufed = ¢ ii Ths red fs calculate ___no.__of-_tested ; | Defecrining the nomnber of Granches in ~ ol___imefhad i eaaty Boolean —_decinrn -obviraurly have two outeames (Tand F)s I e for. each Qe case + the tote! oo.of. dedstons_ouhcamer fe in gq onc thi is equa fo__the fo. covered cd the entry —_breinched in he nrethad = A per above ression is true when condifion 1 is fre nc} oondifion 9 is froe ged the test expression is then condition l false - feCondition Coverage: Th is used) to cover. all the: = condition i! Goredition covetaig. © i also lmown as preadicat e in which _each One of Ne, boiteling expression have evaluated ii “e (cxeo bd de=g print Qj Code Complexily is nq oystem. foc’ soba through review and_ wallthiaugh op per planned ase are diffeutt to meine) n in poe =Test Cage s=~ Condifion Requirement dL) Cyelomafic complexity introdused by Thomas Mctabe in 49°76. iil Tits ienply measure fhe amount of decision [agic in program medale- ail. Cyclomatic complexity i mintmom to. of path that can qeferale al pastible path throsg h the vmod ule. iv] McCabe's camel. ily Sto sed 1 4g define inimam oa. of fest cop required for imodole!s and ik sae: uriog WiC s quantify maiffainabilify and tectabiliy . v) Cyelomatte complexity is defined as co = F~ nipa (Gems Tet enithoretic EeteNe. of. Edges a graph. = No. of Noles of qroph P= No of wanected components. vill Tn mse of connectec) qieiphs, cc =-F=N42 vith |) Tn i ik canbe defined “No. of Decision points in -qsaph- * | conto FLow GRAPH= (ceG) ¢ 1 g rey pe Sequential rf if-else: ulwile or any: [oop es os procedure This method enables proycammne r to __ drive \ complex: design and use _as_ quidesbosic Page Noe Dato: Oo) execution © cet of. path= is Tk defining Bt inten paths nt Develo Called ep resenh Ged for |_t iE designing al examl ne exccufign = foam contra] contre} of asec flow i flaw —r réle atjeort ane? Plow of —preqrane feat ica false—— [wt A x ill_Ako known at behavieria! _ fecfing 2 nq methad ee ee eae |__in______ ‘inlonoxba a being terted is pak known fo she festor ‘ill These fost can be funchiona | or - fonction - iv)| Example tester without knowledge of te lruchore, of —ubbsite fect the by —_uting = -hraucet i remne | Fil Requirement. Based) Testing Bil) Positive ive Teyfin a i Boundary, ‘Va Analysis rrivl Decision _Tobler v}- Equivalence Partitioning vil_ User Do cumenfattion Testing == | ill Requirement Bas d Testing; 80 # | Stage of tequirement _tecting-= 7 heh t Ts a esting approach in —_ahic (| Hest cases condifionr and , t derived oom bequiteme nts if incldes ii functional _ond non: functiong |: altri butes I ach os. ped nce, realibility or i Usability i Hl Defining stagec come lotion criferia: 5 L Texting is comple heel only chen func: i ~funcf. 5 ing f L i iil! Design Tesheses: A festease ho five potomelers namely the initia fake! or _pre- THT i iill Execute tats: 1 Execute the _fesfrases against the system onder ns) fost! ment | the results “ il! Veref Test cesult : ! 7 Verify if the expected’ and aca] : I —results match eachother 7 , rm : i | Vert Te pie : + Venfy fo fhe feck gover both finetiandl and — i =ton functiona | aspect of tequireme. nts. vil | Troscke and manage the _defects: 7 7 Any defect luring ——the testin process goes __ through Wee ta an are frock to resolution - syste pected! oe a alae Positive Tect Positive | Testing is the testing process where the ystem, validate. inst i input data. In this Festing, fester always check for is | anit vali { of value in 2 iJ Z ie i yes as we expected inputs.. = Example Ache cking List fle “syskem Cor Username a cua 6 positive tecting - | Passaord box ahould 4 not expect less thanft |__Gyskem ; ————— Negative. w Tnpot x ing sli - ¢ festing process —__ Testing den check wall iclke s __ in putz ‘he meio. © ay } ah “ as s — Ecample- We how kd | where __ the sy ee check whether eoffware oyna —— error a E only ink aa the shelitie age daxtox are! of app: “Either it validation error __mestago so ptovide the Valves [ike ch eck should Sabcd” in bchauiour= show Io? Text Arey id n : fo Ts also called bow contition mea ff i th vali x avalid boundaries - : = lef Os __asswie Hat—levdosice tho - 40 ~50kph to get Feel ofltceneyee VALUE Invalid Valid Tent lid f les Case Testa Goin =1) i (rox 20 [Eevee a E aa 40,41 , §0, 74. et zit a thigh: = Tend also. called os_— infernal body. nelst ihlernal bondaxy it fakes intemal -Sub= boundary of the program, input ne Power ae binary. 0 ae bil representing oO and 1’, bghes: mato opal Gi word mado wh of 4 by bec GreNo- Tecm Value L bik Ofot oe Nibble afols oS byte 9 fo 25s tok dard ga to6ss3s a Kilo | sow. 6 mega. 1o4es7S z Stiga ieH224 & tera -decision irae fo a ae = aN i! Assigning | Geample- The tat ‘that fl bser — proxi Jes the guest psetnane anc password « | > will Jicected tothe if i slong. 20 __ertor_sq il) ploy i dole 2 | Aule3 erngme. Jv FE R uF t ofp i E | wheres J: ner nad £ user (pact cteeh i Lispleyed! deriving “the toble s ‘IDecision———foler——ean-be—ose Gal Ascision_fqble forPage or Dato: 1 \ Joterprehubien——of-——aboie—lectearen sean } —coseT | username __and password __wete_wronquser_willga)_ Jsername cues cortect bul posses rong oo sq ail 66__displayed + User. ——19=—=__wtota yp =epall oxcect ———. } + Gri_user and pas suet correct the ter £ Mey L ge: : itectod to homepage aad : = ™~™~ ‘Vall = = i fikioni class partitioning ; vehlee. Ps 7 wdtleast-| once «4 of | vincquivalent data from which Jerhrases can be _ derived - |_Apptoach behind Mik isl to 4 steduic the time required for performing os Ih testing of 3 coftwure ides! food lh f +, Pew —___| identify three _vali|__parfi don 2 invalid poctitian which i hour below:Valid = Invalid arFiFon Test. Test fase Core Cae Coe it check if Ghat is alnfed inthe S quailable- fo the softwere. ill Toittin a char ifr aha ies here ini thle 7 | ovedect jasc explained) - in —the document. il are Sar ne con _soive andl erc-ani : of): time’ r Maney —iw]| Documentation festing fey — a eating rE lot fhe : : phils oe i 7Tsing. ; led ites Stabs based testing. —___ | This ts dane tel elll atideg AG tion phase - fips leinentation fae against epecification = and_dlso wlomatic! generation of for. implementation. \ transaction or ae dligibilily far leave manager ensure feasibility. __ feasille managet—appinue [ecu a] —~+) —— oof feasble _——1I = rejects = = eliligible ts repetts boy| _ * Graph Tle, pe i Ps Application System 29 | |