Whal is Tesh 2 Explain? . Testing: Testing iS a Process OF eiecising ov euala- aling a System Cornponenls by manual’ ov auton - aled means to uevify thal it Salispies Specified Dequivements. Me Purpose OF testing is. 40 Show thal 3 progiam | has bugs “The purpose of testing iS 40 Find tr ever ov miscanc plian thal fed 40 the program's Failure and fo design: and iro ple ment ‘the Progiarn | changs tbat _comecd - fhe avrov | flesting Stavis with known Conditions, uses precept Ned plocedures and has predictable outcomes. . Resting ean ane Should be planned .designec! ancl | Scheduled. G+ ig a Cemomstation OF etwr Or appareal covreciness. OF Prous a Plograromers | Pai lure. The Puypose of testing: , Aesling consumes alkast halp op the time 2 cudsk | stequired to Produce a functional Program (MYTH : Good Plogianenys Ustite Code eoithaul “bugs. | History Says that @Uen evel Goritten pr 7 OgQvams Still have Fs bugs per hundred shatenud | | a =a Mests can be designed fiom & functional IShucke| ‘al poinl ap View. , i , | Functional sting: Me procarn | Function is these las a black bak. tt is Subjected to '‘Opats and, | [its aulpuls ate ue i pied _ for conparmance to Spec-,tpied behaviouy Functional testing takes the Usev “point of Uiew- bothey @baut functonality 2 featu- reS and nat the plogiams implementation. Structural (sting: Gt looks at the imple mentation delails. Things such as progremenng Style, conto! method, Souree language , database design & coctin detaile comindle Structural sestiog: The Se Ore inhete-| | tly pinite bul cannat detect all errors | 2) What is Notstional Evolution? | Mhe contol plu graph is simpligied se pre Seststion Op the progran's Structure. The notation changes [enadk in Creation op conta! Flow qrophs : ; (ETH PVOGSsS boxes Weren} sealky Neeckel | There iS an “implied Ploass on euery line qoining qunctions 2 ideci sions. : RWe dont Need to know the Specifics Of the deci- | SioNS , gush 4he fad Thal there ig a branch. | & The Specific +argt label names sient important qust dhe pact they exist. G0 we can ate lace thems by Sinope Numbers. ‘ x fesies ; : Example Cone* (por) INPUT yy Zisvay Viet-y IF Z7=G Goro san JOE 2 Z:=Z-! SAM! Z:=Z4vFoR U= 6 Toz VOU) ,UW) = C244 (F VU) =6 Goto voeé Zi ZA \F Z= Goto ELL UO: =O4) Next u VW 1): VCO) 4uCven) ELL: VCU4UCy)) 2 U4 IF Vev Goto goe \F Uv THeN Ur2z Z=y END SUNPoT 4 y |} zal fic SS “S.gam) No XSOE) Zz} EZ} 0-8} Coop) No e U= O41 eZ ‘L= oT} Coop) yee ‘es {uCo-)= vox) + 0-0) |} EL MOF OW EOF} Fig One -to- One Flow CharORT 6 tes =o s Kto ~ \PROcess 3 }-———, . “|PRocess 5 3 : =o? PRocE SS .G a Even Simplified Plow qh rotaten.a a The Pinal transpormnalion is coheve Cue Raue Hopped the Mode Numbers fo achieue On. 2uern Sinn ply ore pe-| | Serntalion. The way fo, wwork with control Pho: grpts is do Use the Siroples!’ possible ote pre serttstion Abst 1S, 00 More information thal you need do conelate [back to. Sauice Prograro] POL: Explain Nansaction Flow Rsling? PB Mansaction iS a unit OF Work Sen fiom 2 Systees User's Point oF Views. @ consists of Sequence (SF Operations, Same Of which are fOer Formed! by A Systers, Pevsons ov Ckuicas thal Ste outsick of te | System. , Example: .| Pp | a Ps Fs ) mes] ord Fev ets | fiom CPU orm | Ps @- Wansrnt | [pag te | te wmina bs wait For 1 ceuS | CanfiresRansaction Flow @ sling Mechnique s: | Gel th: transaction plbws "Complicated Sysleme thal proass a let af cifferd Complicated tansactiors ‘Should thave explicit Sepro Sentalions. af the transection flouss ov equiuslenst kNansaction Pluss ave like comhol Flos raphs, 2 Consequently Ux Should exprcl to have Then In ie Yeasin Neuele of details Th & ystems Asian documenstttion Should contain AN OUeWiew Secfian tha} details th main Aransac-. tion Plus. De DSpections, Reviews 2 Walkthroughs s Transaction Flows aie natural agenda for System Skuiewss Ov in Spections . Joi) | [3 Pets Sthetian: ¥ Selecl a get of cousin “paths (C142) Using the janatogeus evitevia you Should use for Shectuiral | palb ey . * Select ao Coucring Set of palbs based on Rurchonaty Sensible tvangactons as you woul! for Corto Flaw © | graphs Trg Pod the most torus, tongich Strange! palh «fron, the tote do dhe exist OF the -hans- action fu.Zz Path Sensitization: * Mosh of the Movmal palbs are ery ease to en. | GSidize - Bor, — 5h transaction Plow collrecp qeeey iS UsSualky Cagy to Achieue. |* Sensitization iS the ad of “depinin dh shan sacten 4e there’ are Sengifization Plobems On the easy pshs, thea bd on eithey a buq in drangaction flows oF la chsign bu ) Patty OchuieeCatation: + foshumertalion plays a bi Vv acle iO Wan sactiag Plo testing +han in Unit palh testing. & The ioformation of the path taken’ for & given transaction must be kept with that transdction land Can foe recorckd by A Cential tan sactiod ¢ dispatchey or. by inetuicual rrrocessiog Mockile s - A:Explain the Basics of ata Flous (a sting?’ Qata Flows Gesling: a ata Plow ein iS dhe Oamegiuen fo fami of test Strate eS KaSed on Select Pals thas - bo the pro vars contal Flow in of do explore Sequenas OF guents ralated to the Status opdsl: objects Qata’ Flow Machines: x There are tubo types of data flow machinis will Gippere) aychitectures. ‘Von Neumann Machines | 2. Multi- instruction , mnuldi deta machines {mini} | Yon Neumann Maghine Savehitectare : * Most computers are Von-eumaan machines. ' 4 The Von Neumann machine architecture 2tecutes one INStuction at A time-i0 the, piecing Micro instruction Sequence: = Fach instuction Fron rouerony > Ootev pret in shauction => Fetch Operands , | => Proass ov Execute . | = Stove result ; => Vocrernent Peqem Scrat D604» ‘ y ‘ MIMD aichitectin: ‘ , ¥ THR Se Machines Can fetch ‘Sederal inStuctiong 2 Objects in parallel. # They can also do evithmnstic 2 by ‘cal Opersk fons | Simultaneous 00 different data. | Bu 9s Surnplion: ae) | ¥ The bug assumption poy eqes iS thal contol flow is g That somthing has dala Plow tesh chal Greatly Correcl “and lone ACN Lait the Sofware. So that data “objects are not available ohn thes Should be, or silly things Are bei "i com do the jala _Objeets. _ Jvil (‘Oata Flow Gvaphs: ‘ ' + Thr dala Plow qvaph'is a qerh consisting of Modes and direekd links. A We coill Use a control raph Jo Shows what hap- pens to data’ objects op interest at! thah morrest % Ouv objective is to expose ciuiations betwen ea data Plowog wwe haueraned the data flows we | bwoarh 5 - Explain dbbout “ Qomain palb 2 predicates ? Aomain is a Cet OF Possibke Values Of an inck-| Pencerst! Uariatle |+he Uariables op @ Punetion. - | 4 @m domain ‘Fectin » Predicates ate assumed to | be inteypreka in Feng of 'Nput Ue ctor Uavia bes. HIP domain ding is Opplied fo Structure, then Predicate ote ypre ation Must be based on actusl | PAbS Ahrougk the toutine — that ig basecl on ten | Plementation ‘Conta! floc GOPb- ¥ For eueny domain there is Stleast one pal thos -) | gp voutine: x There Ma sBe More than one path ip the domain | | consists of disconnected Parts Ov If the domain 1S ch fined by the union of uo or pore Clarnc ins x Komains are Chpired Ahiv boundaries. Romain bourdlavies ave algo cukesk moct domain bugs occurs4 For euew boundary thee if SHeast ore: precli-| cate thal. Specipies what Curnbers belong to fhe domain and what Dumbers cont + A domain may have one OF More foundaries— Do Malley bow ma Uaviables Apine it: | For example, ip the preclicatle ($ ¥2442 CIE, the Idornain is dhe ingick op a circ op radius 4! ‘About the Ovigin. Sinnilarly, cue Could! dhpire @ | Sphevical Clhmain witb one Boonen but inthree | Uaviables. '¢ Camaing are Usually Aepined by many bounelar (Seqments 2 therefore by many preclicates be the Sel op inte preted. predicates traversed, on that patb dpines the comaing bouncavies. | ° ¥