Question: Graph II. N = {1, 2, 3, 4, 5, 6) No (1) N-(6) E =((1,2), (2,3), (2,6), (3, 4), (3,5), (4,5), (5.2) def(1) - def(3)

 Graph II. N = {1, 2, 3, 4, 5, 6) No(1) N-(6) E =((1,2), (2,3), (2,6), (3, 4), (3,5), (4,5), (5.2) def(1)

Graph II. N = {1, 2, 3, 4, 5, 6) No (1) N-(6) E =((1,2), (2,3), (2,6), (3, 4), (3,5), (4,5), (5.2) def(1) - def(3) = use(3) = use(6) - (x) 11 Assume the use of x in 3 precedes the def Test Paths: +1 -11.2, 61 12-[1, 2, 3, 4, 5, 2, 3, 5, 2, 6] 13 - [1, 2, 3, 5, 2, 3, 4, 5, 2, 6] 24-11, 2, 3, 5, 2, 6] (a) Draw the graph. (6) 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). (c) Determine which du-paths each test path tours. Write them in a table with test paths in the first column and the du-paths they cover in the second col- umn. For this part of the exercise, you should consider both direct touring and sidetrips. (d) List a minimal test set that satisfies all defs coverage with respect to x. (Direct tours only.) If possible, use the given test paths. If not, provide additional test paths to satisfy the criterion. (e) List a minimal test set that satisfies all uses coverage with respect to x. (Direct tours only.) If possible, use the given test paths. If not, provide additional test paths to satisfy the criterion. (f) List a minimal test set that satisfies all du-paths coverage with respect to *. (Direct tours only.) If possible, use the given test paths. If not, provide additional test paths to satisfy the criterion

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!