Back to schedule page
Prev Next
Quiz Number 6

SWE 637, Fall 2017
16 October
 

Print your name on the line, top right, then answer the questions as concisely as you can. Please write neatly; if I can’t read your answer I have to mark it wrong.

  1. (10 pts.) Answer the following questions for the graph:
       N  = {1, 2, 3, 4, 5, 6, 7, 8}
       N0 = {1}
       Nf = {8}
       E  = { (1, 2), (1, 3), (1, 4), (2, 1), (4, 1), (3, 5), (3, 6), (3, 8), (5, 7), (6, 7), (7, 8) }
    
    
    1. (1 pt.) Give Reach (3), the set of reachable nodes from node 3.
    2. (1 pt.) Is [1, 4, 1, 3, 6] a test path? (If not, say why not.)
    3. (1 pt.) Is [1, 4, 1, 2, 1, 3, 5, 7, 8] a test path? (If not, say why not.)
    4. (1 pt.) Is [1, 3, 1, 3, 5, 7, 8] a test path? (If not, say why not.)
    5. (3 pts.) Give test requirements to satisfy edge-pair coverage.
    6. (3 pts.) Give test paths to satisfy edge-pair coverage.