# SWE 637 Homework 5Fall 2017 Graph Coverage

### Due 16-October, beginning of class

“Poor quality leaves a bad smell long after the sweet taste of meeting a deadline is gone.”

Answer the following questions. Bring hardcopies of your answers to class; either hand written or printouts. All homeworks are due before class on the due date. You may use one of the collaborative options as specified on the syllabus, but any help not allowed by that policy will be an honor code violation.

1. (20 pts.) The following set of edges defines a graph:
E = { (1, 2), (1, 3), (1, 4), (2, 7), (3, 2), (3, 4), (3, 5), (3, 6), (4, 7), (5, 2), (5, 7), (6, 4), (6, 7), (7, 8), (7, 9) }
N0 = { 1 }
Nf = { 8, 9 }
Use this graph to answer the following questions.
1. Draw the graph. Be sure to annotate the initial and final nodes correctly.
2. Is the sequence [1, 3, 6, 4, 7, 9] a Test Path?
3. Is the sequence [1, 3, 2, 7] a Test Path?
4. Is the sequence [1, 2, 4, 7, 9] a Test Path?
5. What is the reach set for node 4?
6. What is the length of the shortest test path?
7. Does the Test Path [1, 3, 6, 7, 9] tour subpath [6, 4, 7, 9]?
8. Give the test requirements for edge-pair coverage.
9. Give the test requirements for prime path coverage.