软件测试hw3 书后习题

题目程序如下

    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(isDivisible(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 t1 = (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 ，则测试用例t2可以发现该fault，而测试用例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.

设计测试用例t=(n=1)，则该测试路径包括一条链接while与for的边，并且不经过while循环的body部分。

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

点覆盖：
{1,2,3,4,5,6,7,8,9,10,11,12,13,14}
边覆盖：
{(1,2),(2,3),(3,4),(3,12),(4,5),(5,6),(5,9),(6,7),(6,8),(7,9),(8,5),(9,3),(9,10),(10,11),(11,3),(12,13),(12,14),(13,12)(15,14)}
主路径覆盖：
[6,8,5,6],[8,5,6,8],[8,5,6,7],[12,13,12],[13,12,13],[13,12,14]
[8,5,6,7,9],
[1,2,3,12,13],
[1,2,3,12,14],
[1,2,3,4,5,6,7,9,10,11],
[1,2,3,4,5,6,8],
[1,2,3,4,5,9,10,11],
[3,4,5,6,7,9,10,11,3],
[3,4,5,6,7,9,3],
[3,4,5,9,3],
[3,4,5,9,10,11,3],
[4,5,6,7,9,10,11,3,4],
[4,5,6,7,9,3,4],
[4,5,9,3,4]
[4,5,9,10,11,3,4],
[5,6,7,9,10,11,3,4,5],
[5,6,7,9,3,4,5],
[5,9,3,4,5],
[5,9,10,11,3,4,5],
[6,7,9,10,11,3,4,5,6],
[6,7,9,3,4,5,6],
[7,9,10,11,3,4,5,6,7],
[7,9,3,4,5,6,7],
[9,10,11,3,4,5,6,7,9],
[9,3,4,5,6,7,9],
[9,10,11,3,4,5,9],
[9,3,4,5,9],
[10,11,3,4,5,6,7,9,10],
[10,11,3,4,5,9,10],
[11,3,4,5,6,7,9,10,11],
[11,3,4,5,9,10,11]

基于Junit和Eclemma实现一个主路径覆盖的测试

设计测试用例t=(n=5)，其覆盖路径为：
[1,2,3,4,5,6,8,5,9,10,11,3,4,5,6,7,9,3,4,5,6,8,5,6,8,5,9,10,11,3,4,5,6,7,9,3,4,5,6,8,5,6,8,5,6,8,5,9,10,11,3,4,5,6,7,9,3,4,5,6,8,5,6,7,9,3,4,5,6,7,9,3,4,5,6,8,5,6,8,5,6,8,5,6,8,5,9,10,11,3,12,13,12,13,12,13,12,13,12,13,12,14]
其代码如下：
被测程序：

package prime;

import java.util.Scanner;

public class primes {
    public static int MAXPRIMES=100;
    
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in); 
        System.out.println("请输入整数n:");
        int n = sc.nextInt(); 
        String str=printPrimes(n);
        System.out.println(str);
    }   
    
    public static String printPrimes(int n) {
        String str="";
        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(isDivisible(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++) {
            str+="Prime: ";
            str+= primes[i];
            str+="\n";

        }
        return str;
    
    }// End printPrimes.
    private static boolean isDivisible(int p, int curP) {
        if(curP%p==0)
            return true;
        else
            return false;
    }
}

测试程序：

package prime;

import static org.junit.Assert.*;

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

public class primesTest {

    @Before
    public void setUp() throws Exception {
    }

    @Test
    public void testMain() {
        primes p=new primes();
        assertEquals("Prime: 2\n" + 
                "Prime: 3\n" + 
                "Prime: 5\n" + 
                "Prime: 7\n" + 
                "Prime: 11\n",p.printPrimes(5));
    }

}

其测试结果为：

测试覆盖结果为：

转载于:https://www.cnblogs.com/mayoneezu/p/8652174.html