468 views

Uploaded by Nur Rachmat

Attribution Non-Commercial (BY-NC)

- Hamilton MultipleChoice
- Chapter 13 Solutions
- Data Mining
- CCNP2 SBA SOLUTION
- Graph Theory Summary Notes
- Graph algorithm
- Domain Driven
- 9712374-Hotel-Management-Project-in-Java-Report.doc
- Operations Research
- JUNG_M2K
- Degree, Order and Size in Intuition is Tic Fuzzy Graphs
- BC0033 MATHEMATICS PAPER 1
- Petri Nets
- BFS
- Shuffling With Ordered Cards
- Solutions 0 CSE 101
- The Math in Good Will Hunting
- On Strong Interval Valued Neutrosophic Graphs
- ATOC-HWI
- Homework 2-Solutions Copy

You are on page 1of 7

Answer questions (a)(d) for the graph defined by the following sets: N = {1, 2, 3, 4} N0 = {1} Nf = {4} E = {(1, 2), (2, 3), (3, 2), (2, 4)} a) Draw the graph.

b) List test paths that achieve node coverage, but not edge coverage. TR = {1, 2, 3, 4} Test Paths : [1, 2, 3, 2, 4] c) List test paths that achieve edge coverage, but not edge Pair coverage. TR = {(1, 2), (2, 3), (3, 2), (2, 4)} Test Paths : [1, 2, 3, 2, 4] d) List test paths that achieve edge pair coverage. TR = {(1, 2, 3), (1, 2, 4), (2, 3, 2), (3, 2, 4)} Test Paths : [1, 2, 3, 2, 4]

Section 2.2.3. 1. Below are four graphs, each of which is de ned by the sets of nodes, initial nodes, nal nodes, edges, and defs and uses. Each graph also contains a col-lection of test paths. Answer the following questions about each graph.

Graph I N = {0, 1, 2, 3, 4, 5, 6, 7} N0 = {0} Nf = {7} E = {(0, 1), (1, 2), (1, 7), (2, 3), (2, 4), (3, 2), (4, 5), (4, 6), (5, 6), (6, 1)} def(0) = def(3) = use(5) = use(7) ={x} Test paths : t1 = [0, 1, 7] t2 = [0, 1, 2, 4, 6, 1, 7] t3 = [0, 1, 2, 4, 5, 6, 1 ,7] t4 = [0, 1, 2, 3, 2, 4, 6, 1, 7] t5 = [0, 1, 2, 3, 2, 3, 2, 4, 5, 6, 1, 7] t6 = [0, 1, 2, 3, 2, 4, 6, 1, 2, 4, 5, 6, 1, 7] Graph II N = {1, 2, 3, 4, 5, 6} N0 = {1} Nf = {6} E = {(1, 2), (2, 3), (2, 6), (3, 4), (3, 5), (4, 5), (5, 2)} def (x) = {1, 3} use(x) = {3, 6} //Assume the use of x in 3 precedes the def Test paths: t1 = [1, 2, 6] t2 = [1, 2, 3, 4, 5, 2, 3, 5, 2, 6] t3 = [1, 2, 3, 5, 2, 3, 4, 5, 2, 6] t4 = [1, 2, 3, 5, 2, 6]

Graph III N = {1, 2, 3, 4, 5, 6} N0 = {1} Nf = {6} E = {(1, 2), (2, 3), (3, 4), (3, 5), (4, 5), (5, 2), (2, 6)} def (x) = {1, 4} use(x) = {3, 5, 6} Test Paths: t1 = [1, 2, 3, 5, 2, 6] t2 = [1, 2, 3, 4, 5, 2, 6]

Graph IV. N = {1, 2, 3, 4, 5, 6} N0 = {1} Nf = {6} E = {(1, 2), (2, 3), (2, 6), (3, 4), (3, 5), (4, 5), (5, 2)} def (x) = {1, 5} use(x) = {5, 6} Test Paths: t1 = [1, 2, 6] t2 = [1, 2, 3, 4, 5, 2, 3, 5, 2, 6] t3 = [1, 2, 3, 5, 2, 3, 4, 5, 2, 6]

Def(0) = {x}

Use(7) = {x}

Def(3) = {x}

5 6

Use(5) = {x} b). List all of the du-paths with respect to x. (Note: Include all du-paths, even those that are subpaths of some other du-path). i. [0, 1, 7] ii. [0, 1, 2, 4, 5] iii. [3, 2, 4, 5] iv. [3, 2, 4, 6, 1, 7] v. [3, 2, 4, 5, 6, 1, 7]

c). For each test path, determine which du-paths that test path tours. For this part of the exercise, you should consider both direct touring and sidetrips. Hint: A table is a convenient format for describing this relationship. Direct Touring Sidetrips t1 i t2 i t3 ii i t4 iv t5 iii, v t6 iii, iv, v

d). List a minimal test set that satisfies all-defs coverage with respect to x. (Direct tours only.) Use the given test paths. {t1, t4} atau {t1, t5} atau {t3, t4} atau {t3, t5} e). List a minimal test set that satisfies all-uses coverage with respect to x. (Direct tours only.) Use the given test paths. {t1, t3, t5} f). List a minimal test set that satisfies all-du-paths coverage with respect to x. (Direct tours only.) Use the given test paths. {t1, t3, t4, t5}

Def(1) = {x}

Def(3) = {x}

3 6

Use(6) = {x}

Use(3) ={x}

4 5

b). List all of the du-paths with respect to x. (Note: Include all du-paths, even those that are subpaths of some other du-path). i. [1, 2, 3] ii. [1, 2, 6] ii. [3, 5, 2, 3] iii. [3, 5, 2, 6] iv. [3, 4, 5, 2, 3] vi. [3, 4, 5, 2, 6] c). For each test path, determine which du-paths that test path tours. For this part of the exercise, you should consider both direct touring and sidetrips. Hint: A table is a convenient format for describing this relationship. t1 t2 t3 t4 Direct Touring Sidetrip i ii, v iii iii ii

d). List a minimal test set that satisfies all-defs coverage with respect to x. (Direct tours only.) Use the given test paths. {t1, t4} e). List a minimal test set that satisfies all-uses coverage with respect to x. (Direct tours only.) Use the given test paths. {t1,t3} f). List a minimal test set that satisfies all-du-paths coverage with respect to x. (Direct tours only.) Use the given test paths. {t2, t3} Graph III a). Draw the graph.

Def(1) = {x}

Use(6) = {x}

Use(3) = {x}

Use(5) = {x}

Def(4) = {x} b). List all of the du-paths with respect to x. (Note: Include all du-paths, even those that are subpaths of some other du-path). i. [1, 2, 3] ii. [1, 2, 3, 5] iii. [1, 2, 6] iv. [4, 5] v. [4, 5, 2, 3] vi. [4, 5, 2, 6] c). For each test path, determine which du-paths that test path tours. For this part of the exercise, you should consider both direct touring and sidetrips. Hint: A table is a convenient format for describing this relationship. t1 t2 Direct Touring Sidetrip i, ii iii i, iv, vi

d). List a minimal test set that satisfies all-defs coverage with respect to x. (Direct tours only.) Use the given test paths. {t2} e). List a minimal test set that satisfies all-uses coverage with respect to x. (Direct tours only.) Use the given test paths. {t1, t2, [1, 2, 6], [1, 2, 3, 4, 5, 2, 3, 5, 2, 6]} f). List a minimal test set that satisfies all-du-paths coverage with respect to x. (Direct tours only.) Use the given test paths. {t1, t2, [1, 2, 6], [1, 2, 3, 4, 5, 2, 3, 5, 2, 6]}

Def(1) = {x}

Use(6) = {x}

Def(5) = {x}

Use(5) = {x}

b). List all of the du-paths with respect to x. (Note: Include all du-paths, even those that are subpaths of some other du-path). i. [1, 2, 3, 5] ii. [1, 2, 6] iii. [5, 2, 3, 5] iv. [5, 2, 6] v. [5, 2, 3, 4, 5] vi. [5, 2, 3, 4, 5, 2, 6] c). For each test path, determine which du-paths that test path tours. For this part of the exercise, you should consider both direct touring and sidetrips. Hint: A table is a convenient format for describing this relationship. Direct Touring Sidetrip t1 i t2 i, iii i t3 i

d). List a minimal test set that satisfies all-defs coverage with respect to x. (Direct tours only.) Use the given test paths. {t1} e). List a minimal test set that satisfies all-uses coverage with respect to x. (Direct tours only.) Use the given test paths. {t1} f). List a minimal test set that satisfies all-du-paths coverage with respect to x. (Direct tours only.) Use the given test paths. {t1}

- Hamilton MultipleChoiceUploaded byMorris Centeno
- Chapter 13 SolutionsUploaded byIshdeep Singla
- Data MiningUploaded byMiel9226
- CCNP2 SBA SOLUTIONUploaded bychanjohn01
- Graph Theory Summary NotesUploaded byyoung07ly
- Graph algorithmUploaded byHafidz Jazuli Luthfi
- Domain DrivenUploaded bycdbatista2010
- 9712374-Hotel-Management-Project-in-Java-Report.docUploaded bysiddi gyaneshwar
- Operations ResearchUploaded bySam Sams
- JUNG_M2KUploaded bymhenley8059
- Degree, Order and Size in Intuition is Tic Fuzzy GraphsUploaded byPalanivel Kasilingam
- BC0033 MATHEMATICS PAPER 1Uploaded bySeekEducation
- Petri NetsUploaded byMitesh Patel
- BFSUploaded byAntony Albert
- Shuffling With Ordered CardsUploaded byAniruddha Singhal
- Solutions 0 CSE 101Uploaded byKel
- The Math in Good Will HuntingUploaded byGuillermo Ceos
- On Strong Interval Valued Neutrosophic GraphsUploaded byAnonymous 0U9j6BLllB
- ATOC-HWIUploaded byHafiz Wahid Iqbal
- Homework 2-Solutions CopyUploaded bySri Harjan
- IJETTCS-2018-05-01-1Uploaded byAnonymous vQrJlEN
- Strong Regular L-Fuzzy GraphsUploaded byEditor IJTSRD
- Assignment 1Uploaded bydivyanshuvarma
- dsa ch7 graphUploaded byapi-394738731
- 03Uploaded byranjithzen
- Presentation Guideline ISCADB 2017Uploaded bydanilrios
- Holonic Virtual Geographic EnvironmentsUploaded bySEP-Publisher
- MATHUploaded byirwan syah
- 166-1497-1-PBUploaded byMallikarjunMatti
- 13Uploaded byiaetsdiaetsd

- WDSentinel DX4000Uploaded byLiliana Cabrera
- Whatsappgrouplinks.org-Join Bangladesh Whatsapp Group Links ListUploaded bywhatsapp group links
- SGP.11_v3.1Uploaded bymofumofu001
- Guia de Referencia Optiplex 745Uploaded bynikoll1953
- xbeeUploaded byVictor Gonzalez
- 5. OptiX RTN 910 - 950 Networking Application and Protecion ISSUE 1.00Uploaded byarielp31
- Page Rank AlgorithmUploaded byvenkatsahul
- CCNA A Spring 2016 1.3.1.3 Lab - Mapping the InternetUploaded byJame Chan
- mainreport.pdfUploaded byJyotishmoy saikia
- 5140 service.pdfUploaded bybehzad
- CiscoPrimeCableProvisioning-6 0 1-UserGuide Chapter 011101Uploaded by류민우
- Aiphone Model AX QuikStart Guide- Westside Wholesale - Call 1-877-998-9378Uploaded byWestsideWholesale
- (CCNA Training -273 EIGRP Tutorial)II.psUploaded byPranav Gupta
- Qk Install IVTUploaded byklein1778
- SMTP Status Codes LibraryUploaded byronycd2003
- Traffic management and other practices resulting in restrictions to the open Internet in EuropeUploaded byTheGift73
- Water Quality Monitoring SlidesUploaded byullascs
- MobileIron Policy RecommendationsUploaded bykinky1234
- Static NAT in SRXUploaded bySon Tran Hong Nam
- Chap 2Lesson04EmsysNewUploaded byphanib86
- D Link DIR 615 ManualUploaded byHillary Coleman
- ICS SystemsUploaded bycena018
- oops sylaUploaded bySree Murthy
- t 065 b 0000320013 PDF eUploaded byAhmed Albidhany
- ACPN a Novel Authentication FrameworkUploaded byshalini
- Ursalink Industrial Cellular Router UR51 DatasheetUploaded byUrsalink Marketing
- Voice Recognition Based Call and Notification Android AppUploaded byVigneshNedunchezhiyan
- GPS104 GPS Tracker User ManualUploaded bySam Loer
- Configure Linux Yum ServerUploaded byAshief Ahmed
- IRDH275-375-575_.pdfUploaded byDeepak Jain