Use the following method printPrimes() for questions a-f below

Code

/******************************************************* 
 * Finds and prints n prime integers 
 * Jeff Offutt, Spring 2003 
 ******************************************************/ 
public static void printPrimes (int n) 
{ 
    int curPrime; // Value currently considered for primeness 
    int numPrimes; // Number of primes found so far. 
    boolean isPrime; // Is curPrime prime? 
    int [] primes = new int [MAXPRIMES]; // The list of prime numbers. 

    // Initialize 2 into the list of primes. 
    primes [0] = 2; 
    numPrimes = 1; 
    curPrime = 2; 
    while (numPrimes < n) 
    { 
        curPrime++; // next number to consider ... 
        isPrime = true; 
        for (int i = 0; i <= numPrimes-1; i++) 
        { // for each previous prime. 
            if (curPrime%primes[i]==0) 
            { // Found a divisor, curPrime is not prime. 
                isPrime = false; 
                break; // out of loop through primes. 
            } 
        } 
        if (isPrime) 
        { // save it! 
            primes[numPrimes] = curPrime; 
            numPrimes++; 
        } 
    } // End while 

    // Print all the primes out. 
    for (int i = 0; i <= numPrimes-1; i++) 
    { 
        System.out.println ("Prime: " + primes[i]); 
    } 
} // end printPrimes

Draw the control flow graph for the printPrime() method.

Consider test cases ti = (n = 3) and t2 = ( n = 5). Although these tour the same prime paths in printPrime(), they don‘t necessarily find the same faults. Design a simple fault that t2 would be more likely to discover than t1 would.

MAXPRIMES = 4的时候

For printPrime(), find a test case such that the corresponding test path visits the edge that connects the beginning of the while statement to the for statement without going through the body of the while loop.

n = 1的时候

Enumerate the test requirements for node coverage, edge coverage,and prime path coverage for the path for printPrimes().

节点覆盖

• 0，1，2，3，4，5，6，7，8，9，10，11，12

边覆盖

• [0, 1]
• [1, 2]
• [1, 9]
• [2, 3]
• [3, 4]
• [3, 7]
• [4, 5]
• [4, 6]
• [5, 7]
• [6, 3]
• [7, 1]
• [7, 8]
• [8, 1]
• [9, 10]
• [10, 11]
• [10, 12]
• [11, 10]

主路径覆盖

• [0, 1, 2, 3, 4, 6]
• [0, 1, 2, 3, 4, 6, 7, 8]
• [0, 1, 2, 3, 7, 8]
• [0, 1, 9, 10, 11]
• [0, 1, 9, 10, 12]
• [3, 4, 6, 3]
• [4, 6, 3, 4]
• [6, 3, 4, 6]
• [6, 3, 4, 5, 7, 8, 1, 2]
• [6, 3, 4, 5, 7, 8, 1, 9, 10, 11]
• [6, 3, 4, 5, 7, 8, 1, 9, 10, 12]
• [6, 3, 7, 8, 1, 2]
• [6, 3, 7, 8, 1, 9, 10, 11]
• [6, 3, 7, 8, 1, 9, 10, 12]
• [10, 11, 10]
• [11, 10, 11]

List test paths that achieve node coverage but not edge coverage ont the graph.

• [0, 1, 2, 3, 4, 6, 3, 4, 5, 7, 8, 9, 1, 10, 11, 12, 13, 11, 14]

List test paths that achieve edge coverage but not prime path coverage on the graph.

• [0, 1, 2, 3, 4, 6, 3, 7, 8, 9, 1, 2, 3, 4, 5, 7, 9, 1, 2, 3, 4, 6, 3, 4, 6, 3, 7, 8, 9, 1, 10, 11, 12, 13, 11, 12, 13, 11, 12, 13, 11, 14]