This question is from Software testing.

a set N of nodes a set N0 of initial nodes, where N0 N a set Nf of final nodes, where Nf N a set E of edges, where E is a subset of N N

Answer questions ad for the graph defined by the following sets:

N = {1, 2, 3}

N0 = {1}

Nf = {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?