1. Redefine Edge Coverage in the standard way (see the discussion for Node Coverage). 2. Redefine Complete Path Coverage in the standard way (see the discussion for Node Coverage). 3. Subsumption has a significant weakness. Suppose criterion Cstr ong subsumes criterion Cweak and that test set Tstr ong satisfies Cstr ong and test set Tweak satisfies Cweak. It is not necessarily the case that Tweak is a subset of Tstr ong. It is also not necessarily the case that Tstr ong reveals a fault if Tweak reveals a fault. Explain these facts. 4. Answer questions ad for the graph defined by the following sets: N = {1, 2, 3, 4} N0 = {1} N f = {4} E = {(1, 2), (2, 3), (3, 2), (2, 4)} (a) Draw the graph. (b) If possible, list test paths that achieve Node Coverage, but not Edge Coverage. If not possible, explain why not. (c) If possible, list test paths that achieve Edge Coverage, but not Edge-Pair Coverage. If not possible, explain why not. (d) List test paths that achieve Edge-Pair Coverage. 5. Answer questions ag for the graph defined by the following sets: N = {1, 2, 3, 4, 5, 6, 7} N0 = {1} N f = {7} E = {(1, 2), (1, 7), (2, 3) , (2, 4), (3, 2), (4, 5), (4, 6), (5, 6), (6, 1)} Also consider the following (candidate) test paths: p1 = [1, 2, 4, 5, 6, 1, 7] p2 = [1, 2, 3, 2, 4, 6, 1, 7] p3 = [1, 2, 3, 2, 4, 5, 6, 1, 7] (a) Draw the graph. (b) List the test requirements for Edge-Pair Coverage. (Hint: You should get 12 requirements of length 2.) (c) Does the given set of test paths satisfy Edge-Pair Coverage? If not, state what is missing. (d) Consider the simple path [3, 2, 4, 5, 6] and test path [1, 2, 3, 2, 4, 6, 1, 2, 4, 5, 6, 1, 7]. Does the test path tour the simple path directly? With a sidetrip? If so, write down the sidetrip. (e) List the test requirements for Node Coverage, Edge Coverage, and Prime Path Coverage on the graph. (f) List test paths from the given set that achieve Node Coverage but not Edge Coverage on the graph. (g) List test paths from the given set that achieve Edge Coverage but not Prime Path Coverage on the graph. 7 Graph Coverage 123 6. Answer questions ac for the graph in Figure 7.2. (a) List the test requirements for Node Coverage, Edge Coverage, and Prime Path Coverage on the graph. (b) List test paths that achieve Node Coverage but not Edge Coverage on the graph. (c) List test paths that achieve Edge Coverage but not Prime Path Coverage on the graph. 7. Answer questions ad for the graph defined by the following sets: N = {1, 2, 3} N0 = {1} N f = {3} E = {(1, 2), (1, 3), (2, 1), (2, 3), (3, 1)} Also consider the following (candidate) paths: p1 = [1, 2, 3, 1] p2 = [1, 3, 1, 2, 3] p3 = [1, 2, 3, 1, 2, 1, 3] p4 = [2, 3, 1, 3] p5 = [1, 2, 3, 2, 3] (a) Which of the listed paths are test paths? For any path that is not a test path, explain why not. (b) List the eight test requirements for Edge-Pair Coverage (only the length two subpaths). (c) Does the set of test paths from part (a) above satisfy Edge-Pair Coverage? If not, state what is missing. (d) Consider the prime path [3, 1, 3] and path p2. Does p2 tour the prime path directly? With a sidetrip?