软件测试HW3

/**
     * 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 - 1; 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.

将代码第23行的

isPrime = false;

修改为

isPrime = true;

t2当判断到4这个数时结果就会出错，但t1不会出错。

 

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.

n=1时不会经过while循环体，直接进入最后的for循环。

 

d) 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, 13, 14, 15, 16}

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

主路径覆盖：{(0, 1, 2, 3, 4, 5, 8, 9, 10, 11), (0, 1, 2, 3, 4, 6, 7), (0, 1, 2, 3, 4, 5, 8, 9, 11), (0, 1, 2, 3, 8, 9, 10, 11), (0, 1, 2, 3, 8, 9, 11), (0, 1, 12, 13, 16), (0, 1, 12, 13, 14, 15),

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

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

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

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

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

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

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

 

基于Junit及Eclemma（jacoco）实现一个主路径覆盖的测试：

PrintPrimes类：

package printPrimes;

public class PrintPrimes {
    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 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 - 1; 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.

    private static boolean isDvisible(int i, int curPrime) {
        // TODO Auto-generated method stub
        if(curPrime % i == 0)
            return true;
        return false;
    }
    
    
}

 

jUnit测试类：

package printPrimes;

import static org.junit.Assert.*;

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

public class PrintPrimesTest {

    private PrintPrimes p;
    
    @Before
    public void setUp() throws Exception {
        PrintPrimes p = new PrintPrimes();
    }

    @Test
    public void test() {
        p.printPrimes(10);
    }

}

 

测试结果截图：