软件测试HW3

1、Use the following method printPrimes() for questions a–d.

a.为printPrimes()方法画控制流图

b.令MAXPRIMES = 4；t2测试出现数组越界错误，t1测试不会出现。
c.n=1时，测试路径访问连接while语句开始到for语句的边，而不用通过while循环体。
d.节点覆盖：{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}
边覆盖：

{(1,2),(2,3),(3,4),(4,5),(5,6),(5,9),(6,8),(8,5),(6,7),(7,9),(9,10),(9,11),(10,11), (11,2),(2,12),(12,13),(13,14),(13,16),(14,15),(15,13) }

主路径覆盖：

{(1,2,3,4,5,6,7,9,10,11),(1,2,3,4,5,6,7,9,11),(1,2,3,4,5,9,10,11),

(1,2,3,4,5,9,11),(1,2,3,4,5,6,8),(1,2,12,13,14,15),(1,2,12,13,16),

(2,3,4,5,6,7,9,10,11,2),(2,3,4,5,6,7,9,11,2),

(2,3,4,5,9,10,11,2),(2,3,4,5,9,11,2),

(3,4,5,6,7,9,10,11,2,3),(3,4,5,6,7,9,11,2,3),

(3,4,5,9,10,11,2,3),(3,4,5,9,11,2,3),

(3,4,5,6,7,9,10,11,2,12,13,14,15),(3,4,5,6,7,9,10,11,2,12,13,16),

(3,4,5,6,7,9,11,2,12,13,14,15),(3,4,5,6,7,9,11,2,12,13,16),

(3,4,5,9,10,11,2,12,13,14,15),(3,4,5,9,10,11,2,12,13,16),

(3,4,5,9,11,2,12,13,14,15),(3,4,5,9,11,2,12,13,16),

(4,5,6,7,9,10,11,2,3,4),(4,5,6,7,9,11,2,3,4),

(4,5,9,10,11,2,3,4),(4,5,9,11,2,3,4)

(5,6,8,5),(5,6,7,9,10,11,2,3,4,5),(5,6,7,9,11,2,3,4,5),

(5,9,10,11,2,3,4,5),(5,9,11,2,3,4,5),

(6,8,5,6),(6,7,9,10,11,2,3,4,5,6),(6,7,9,11,2,3,4,5,6),

(6,8,5,9,10,11,2,12,13,14,15),(6,8,5,9,11,2,12,13,16)

(7,9,10,11,2,3,4,5,6,7),(7,9,11,2,3,4,5,6,7),

(7,9,10,11,2,3,4,5,6,8),(7,9,11,2,3,4,5,6,8),

(8,6,5,8),(8,5,6,7,9,10,11,2,12,13,14,15),(8,5,6,7,9,11,12,13,16)

(9,10,11,2,3,4,5,6,7,9),(9,11,2,3,4,5,6,7,9),

(9,10,11,2,3,4,5,9),(9,11,2,3,4,5,9),

(10,11,2,3,4,5,6,7,9,10),(10,11,2,3,4,5,9,10),

(11,2,3,4,5,6,7,9,10,11),(11,2,3,4,5,6,7,9,11),

(11,2,3,4,5,9,10,11),(11,2,3,4,5,9,11),

(13,14,15,13),(14,15,13,14),(14,15,13,16),(15,13,14,15)}

2、基于Junit 及Eclemma (jacoco)实现一个主路径覆盖的测试。

testPrime.java:

package hw3;

import static org.junit.Assert.*;

import org.junit.Before;
import org.junit.Test;

import hw3.Print;

public class testPrimes {
    private Print t;
    @Before
    public void setUp() throws Exception {
        t = new Print();
    }

    @Test
    public void testCase() {
        t.printPrimes(7);
    }
}

print.java

package hw3;
public class Print {
    private static final int MAXPRIMES = 100;
    /******************************************************* 
     * 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 (isDivisable(primes[i],curPrime)) 
                { // 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
    private static boolean isDivisable(int i,int curPrime) {
        int mod = curPrime % i;
        if(mod == 0) {
            return true;
        }
        return false;
    }

}

结果