Scribd
Upload
4 views9 pages

Testing Notes

testing notes

Uploaded by

kartik gupta
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
4 views9 pages

Testing Notes

testing notes

Uploaded by

kartik gupta
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
Tei yes ans LGvnctine 3 ot white hay deshing > c ‘ © coverage bared testing © cyclomatic — complexity o wotahon testing Th AGRE Reor wera covera ge based testing wethod with fest caved thet is fo covey He program Sahisty Sowet bred COVE AYR ended Stademun} Coveraye ® BraweR ” Condition " (TP) wlible conditoniceanersys (©) Path Coverayy ° S28 Aon cover age teekuique : ho oe Cael to all Conditions. } con SM oe is Blge Ween os! Predicate” Conran y 1, eee emion fave ben utch eackd one saetheilvenenn ee or prem » = hs) Bae fist Ora, bs greater no) 1) 5 . go thse if (mde, AA my d= hy) le te bint ("4g ve is qreaky 2", *>) 5 ; g- els s oa fidf C'dd hs ts Aveaky ve", 93); ‘ ‘ ea ve Steemah covet = 5 th DEney | ice ae mc. 2 50%. " > w@ a it feos on 2% points. @ im ubih ctademord tH variable am defined @D im hich tober He Danish aioe sca a > Ne desu de eee com? Peale covert centr!) flog ih ermend vain ble def”? 2 Mai vw iv We nodule ex ead a, bo tue aed 1 ge ieilad t) awl 213 4 bch ne ohn Ler ae fink x5 ? f S " a else ees oul laa 6 fuk Zp ® Vew) @® vta= tonnected Con tye sen +267 ° pont forwola P=) Cher ingle Preatom of sohmohy la-lo + ay, a = 7+) & pres Pedi cate nodep uties wo? ob Bion am CHITKARA UNIVERSITY Cyclomatic complexity is a software metric used to measure the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. It was developed by Thomas J. McCabe, Sr. in 1976. It can be computed with the help of Control Flow Graph. ##Cyclomatic complexity is a source code complexity measurement that is being correlated to a number of coding errors. ® P43 Cee y a Her > Th goal of effective how te execute Lotalion Hskrg — votd cal Cine RY f Ment = =O) hantt (leven'")3 1 tint FU odd) aehrn j 4 oft Conainal)— eve foctcosé zlo Motolion testing ine Se be sting whe Sfatemets make des} cases vebovste D> |} is alse cabkd fabld based testy 5 & motate (Rage Jailer) ® Prgram and cPeck el find: He eyvrys, e.! ca bre gram aru Ke p+ ° y load dow vel affect te overalt ol El Ll is to develop °| * aly E 5 compeve He yp * if op a different Hun killed He motout oHewise another Fest care vee Valve cal Cink wn) f if (n/a 20) 4 Phot f (“even”); 4 else Gantt Codd"), eturn 5 y ‘ O} P ( metand y -odd (x) Aypes of wvtation esting O value etalon ® Pecision © strtemmnd wolaton eGcoreaid ia MLUS Ai ose Vanesa a tt fotal nod af hotart Advanta ye a I} binga a geod level of evar detection in Hi broga H discovery ambiguities tm Hs Soova Code Dis advan tag, _ Wis woh Ly black box testing, 4 is Reg hy costly, & tm, alr

You might also like