(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.
我们令numPrimes=3,这样n=3时不会发生错误，但是n=5时会发生数组越界
(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)
(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}
边覆盖
TR={(1,2),(2,3),(2,10),(3,4),(4,5),(4,8),(5,6),(5,7),(6,4),(7,8),(8,9),(8,2),(9,2),(10,11),(11,12),(11,13),(12,11)}
主路径覆盖
[1,2,3,4,5,6]
[1,2,3,4,5,7,8]
[1,2,10,11,12]
[1,2,10,11,13]
[11,12,11]
[12,11,12]
[4,5,6,4]
[4,8,2]
[1,2,3,4,8,9]
[8,9,2]
测试用例如下
我的prime文件
package homework; public class prime { private static final int MAXPRIMES = 100; public static String 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 String result = ""; // print all the primes out for(int i = 0; i < numPrimes; i++) { //System.out.println("Prime: " + primes[i] ); result +=primes[i]+","; } return result; }// End printPrimes. public static boolean isDvisible(int n,int m) { if(n!=0){ if(m%n==0) return true; else return false; } return false; } }
我的test文件
package testPrime; import static org.junit.Assert.*; import org.junit.Before; import org.junit.Test; import homework.prime; public class test { private prime t; @Before public void setUp() throws Exception { t=new prime(); } @Test public void testprintPrimes() { assertEquals("2,3,5,7,11,",t.printPrimes(5)); } }
运行结果
