[go: up one dir, main page]

0% found this document useful (0 votes)
174 views15 pages

SVV Lab Manual

Uploaded by

Rakshak Agarwal
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
0% found this document useful (0 votes)
174 views15 pages

SVV Lab Manual

Uploaded by

Rakshak Agarwal
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
You are on page 1/ 15
es for this program. determines the next date in the calender.Its input is entered in the form of d ith the following range: 0 void main(){ intn, i=2, choice, j= 1, flag; printf("TC \t Input \t_ Exp. O/P\n"); _ dof flag =1; printf("\t\t\t\\tEnter the number: seanf("%d", &n); printf("edit", j); printf("%d\t", n); iffn <1 |) > 100){ printf{"Invalid input"); while(i* i<=n){ if(n % i flag = 0; Test Cases (Outpu' 1) Boundary Value T Ce ae! Oe ek ea On) nae) OP heat keas cr) et Soret) ee Or) ee) eke Ut oe eT) Cee eer 2) Robustness Testing / Worst Robustness Testing rt 1 rt ro Pr Cae ae) pose CET Poet enc CeO Cana ees Crratrstr Do you want to continue(@/1): 1 Paes ee Peat Coen eae sUnrtC VEO EEE! ee ee Coasts Do you want to continue(0/1) Bae ener Crest Do you want to continue(o/1) ee eee Ceaser CTE asec Ute) Perse aL eee Sone TEC RUT eet nee ae Cans CCE OEE) process exited after 34.28 seconds with return value © Greer ak messed est cases ag Soren Peete ent Ce een er 4 the val ase) pars eer eE Cys Rrra tia are wae bes Ries onary Cees ney CORT Sees UmC Riacatracvarie met pie? SS ira Ea Ha) Pema mere CCS) er etn) te Conners caren tren Pea cata eae EAC) COST eras] ta Dorm CSCC) Enter the value of afi, 10]! 5 PSUR RON trans aU cers aes Cone er eerretrnrC zee trance nie RRO aan Co Ea) Peer naeeus tab Rene care eae Pent Mon taht an cor Pata trCZes Enter the value of aft, 10]:5 Pevee erst at) eee) Fae ees rat anes rates Pearern urs GT CZs Regenerating Sno ries a eee are te EoOS Ce Rrteeracmet RS rata CoS Parris Cane t aE PRUs ane MRT Ea BSR ana CoE Ea POeerO Sere CCUEtTaEY the value of afi, 20]: "5 ROMS Teeny CHES ERE Ronnie stmcye ts Rickcstiante met rat) CORO TUR aCe Pore Oem scetcyay Oars toa eat EC) RNR a Cnr ey Pon arie etc tree CMC INOareemet ats panos ria ances Ear Pec aac OCS Sree ema ty Eaed RS Pan EHS a) Pui ier an eee CCC O EES Seater ean Ey RNs rat ans CRS ae Corer ak SSCS RTCUEU TaN Rr taareerc ae: SSSR CHS Fay CONN Se STC Racin aer met nity RM trae an CHS Eat) peoreretat nent SECS EEE the value of af}, 40]: 5 PPS ita CHS Pema cet TCE NE RSS tae) Pui Mera Peasant yP Spar 3) Worst Case Testing include h void main() int a, b, printf{"TC \t a \t b \tc \t Exp. O/P aE pepe reeat te Pepe ees rita eS eons Pee ee rerran re Enter the value of bI1, 51: 2 rien Pere etre oe Leetonia CMS He Cee one Paved mete a comet fared ponte CES Coiemteetoon Pere eta bre Coes He poate ony canteen Pate petro Pret) bans Hed oon emetic srt Pei ehes eat CME ae Corer toon Pee cetera et) bereits reat CM ae Cimeeeto on eo cet ate Be peered CM Hd perenne On 2) Robustness Testing Pao Pete nts Fs Fy Fa Fa ete ere Fa 3) Worst Case Testing pe peers es beeen Peas raced eens recanted Cera paneer Cera recent ed ee ee eee Pe ricatedcat ue feere ne ere Pores aon cree emncs Eee} Do you want oad Pere! penne ren ery Pere cries ee Ey reread eet! SOEs Eee reTery eee ed Do you want ecard See nese rey Peaks Poreegresoaeene rec ey eC beet sarede Teer Czeraes Der raSCUetraes beeen rae aes ree bemeete rar iery Pst beieneae rate Pers een is OR LON Tae eee Ceres Ate ae mene ete ae tet RCN ae eee sCoee) Cite Cre rae RES TON a (ora) Cotes ate nea eae CORT TOee) Enter three numbers: 12 2 Pee aera s CES) Enter three numbers: 2 2 1 Peer artes ras 28) Cee eet Tea ae MES eae castes rove eaer nant neae Ce Tet Poe aera oet ree Peart eet ee aes 4) Program #include intged{int a, int b){ iff it return b; } returnged(b % a, a); } void main(){ int a, b, c, more, j = 1, i; printf("TC \t a \t b \tc \t Exp. O/P\n"); dof printf("\t\t\t\t\t\tenter three numbers: "); scanf("%d%d%d", &a, &b, &c); printf("%d\t%d\ted\t%d"j, a, b, c); iffac1 || b<1 || c<1|]a>50 || b>50 || ¢> SO) printf". Invalid input"); yelse { int res = gcdla, b); res = gcd(res, ¢); printf("\t %d", res); } printf("\t\e\t\t\t\tDo you want more test(0/1): scanf("g%d", &more); ca } while(more); Test cases 1) Boundary Value Testing Era Epa Doser tcetCoe te Enter three numbers: 2 25 25 Payee as Eroangn eH eoeaee : Pye een ee ees ; (OS overcame SCRA corte RCE Sos | oreo R Bet 72 as eicioa no ete b Hey Beare Cos uepus a CPS praraee Capers nde aa 5H Pose tierste meas Foe 25 2549 Posi ast on ace Ne! EE OE) Corer sta aC 2) Robustness Testing Ep Linnea pote iecae alent Enter three numbers; 125 25 ae Pops sc kere rE Ciencias ai) - 7 Pre nene enya Be eau He ey ce Cees eC! Greece tears ‘ Poke Cnet eee eee 5 Pee enOayn fe Gece eerie nate Ca enon Bee og saaieecat Borers see tCAe Gretna 1 Pare ee Cnee Eaten eon Boe Pee eC Gece araties Bo PoreeeneartOAy Pree pes arse yes Po tereeanecGnr faba belch Fo nantes Poses ean (Cy faa a ieee 6 fenton Poe eH 1S0 0n 19 test ca 3) Worst Case Testing 1 CVs VABHs\Decument PROGRAMS Des cp Era Cetoaianie asec 1 Gospiens ear sCpyHet Capone caer! ZI Possuemscnacacn ypc Eieaoinesainisacecastst CON EMeris snes Ciieactincatn = ssnee Set Do you want ore test(@/1): 4 EicoRaitaaaear etre Dsjetic stags Cees Ercsadincsiasteeieucael Paes REECE EY Eien lace Covers (O Ft Eicphmsaiacteac eee Doseiernstaas34O Feet Gicoransaiessencoae| Dsante P AEN Grconansaith sea yeagt Poprirstex cas ClN Ce Eiohape sree eaee Cy verus Capea! Cann Suara Pov eruscag OF ere ECR Suir eae’ Do you want more test(@/1): 1 ETC aur ee Popes a act Eich eee ree Experiment No Perform Following list of experiment using equivalence class testing techniques. 1) A program reads three numbers A, B and C within the range [1,50] and prints the largest, number. Design test cases for this program. 2) A program determines the next date in the calender. Its input is entered in the form of with the following range: 0 Struct node { int a; int b; int c;

You might also like