软件测试_作业三

/**
     * Finds and prints n prime integers
     * Jeff Offutt, Spring 2003
*/

    private 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 primes.
        
        // 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; i++ ) {
                //for each previous prime.
                if(isDvisible(primes[i],curPrime)) {
                    //Found a divisor, curPrime is not prime.
                    isPrime = false;
                    break;
                }
            }
            if(isPrime) {
                // save it!
                primes[numPrimes] = curPrime;
               numPrimes++;
      
            }
        }// End while
        
        // print all the primes out
        for(int i = 0; i < numPrimes; i++) {
            System.out.println("Prime: " + primes[i] );
        }
        
    }// End printPrimes.

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

(b) 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.

    将while(numPrimes<n)改成（while(numPrimes<4)使 t2 = ( n = 5) 越界，这时t2更能发现问题。

(c) 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.

    t3=(n=1)，即当n=1时，程序跳过循环。

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

①节点覆盖：

TR={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}

②边覆盖：

TR={（1，2），（2，3），（3，4），（4，5），（5，6），（6，7），（5，7），（7，4），（7，8），（8，9），（7，9），（9，2），（9，15），（2，10），（10，11），（10，12），（11，13），（12，14），（13，14），（14，15）}

③主路径覆盖：

TR={[4,5,7,4],[5,7,4,5],[7,4,5,7],[4,5,6,7,4],[5,6,7,4,5],[7,4,5,6,7],[6,7,4,5,6],[2,3,4,5,6,7,8,9,2],[2,3,4,5,6,7,9,2],[2,3,4,5,7,8,9,2],[2,3,4,5,7,9,2],[3,4,5,6,7,8,9,2,3],[3,4,5,6,7,9,2,3],[3,4,5,7,8,9,2,3],[3,4,5,7,9,2,3],[4,5,6,7,8,9,2,3,4],[4,5,6,7,9,2,3,4]，[4,5,7,8,9,2,3,4],[4,5,7,9,2,3,4],[5,6,7,8,9,2,3,4,5],[5,7,8,9,2,3,4,5],[5,6,7,9,2,3,4,5],[5,7,9,2,3,4,5],[6,7,8,9,2,3,4,5,6],[6,7,9,2,3,4,5,6],[7,8,9,2,3,4,5,6,7],[7,9,2,3,4,5,6,7],[7,8,9,2,3,4,5,7],[7,9,2,3,4,5,7]，[8,9,2,3,4,5,6,7,8],[8,9,2,3,4,5,7,8],[9,2,3,4,5,6,7,8,9],[9,2,3,4,5,7,8,9],[9,2,3,4,5,7,9],[9,2,3,4,5,7,9][1,2,3,4,5,6,7,8,9,15],[1,2,3,4,5,7,8,9,15],[1,2,3,4,5,6,7,9,15],[1,2,3,4,5,7,9,15],[1,2,10,11,12,14,15]，[1,2,10,11,13,14,15]。