SWE 637 Quiz Number 3
February 13, 2012

Consider the graph:

  N  = { A, B, C, D }
  N0 = { A }
  Nf = { A, D }
  E  = { (A,A), (A,B), (B,C), (B,D), (C,B) }

  t1 = [ A ]
  t2 = [ A,B,D ]
  t3 = [ A,B,C,B ]
  t4 = [ A,A,A,B,C,B,D]
  t5 = [ A,A,B,C,B,C,B,D ]

1. Draw the graph.
   Answer: See the graph tool.
2. Identify which candiate test paths that are, in fact, test paths. Indicate the problem with any paths that are not, in fact, test paths.
   Answer: All candidate paths except for t3 are test paths. The problem with t3 is that it fails to end in a final node.
3. List the edge pairs. (You should get 7).
   Answer: The edge pairs are:

          { [A,A,A],
            [A,A,B], 
            [A,B,C], 
            [A,B,D], 
            [B,C,B], 
            [C,B,C], 
            [C,B,D] }
   

4. Which edge pairs does t4 tour directly?
   Answer: [A,A,A], [A,A,B], [A,B,C], [B,C,B], and [C,B,D].
5. Which edge pairs does t4 tour with sidetrips, but not directly?
   Answer: [A,B,D].
6. Which edge pairs does t4 tour fail to tour either directly or with sidetrips?
   Answer: [C,B,C].
7. List the prime paths. (You should get 6).
   Answer:

          { [A A],
            [A,B,D],
            [A,B,C],
            [B,C,B],
            [C,B,C],
            [C,B,D]}
   

8. Give a minimal set of test paths (from the given set) that satisfies Prime-Path Coverage (direct tours only).
   Answer: There is only one minimal set: {t2, t5}