第三次作业主要是主路径覆盖相关知识。
/** * 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 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就有可能出现这样的错误
(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.sd
从图上可以看出,while 和 for 循环 相连的路径是(2,12)
因此如果出现 n = 1 的情况 就会因为 numPrimes >= n 直接由节点2走到节点12
(d) Enumerate the test requirements for node coverage, edge coverage,and prime path coverage for the path for printPrimes().
node coverage 节点覆盖:{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}
edge coverage 边覆盖 :
TR = {(1,2), (2,3), (2,12), (3,4), (4,5), (5,6), (5,9), (6,7), (6,8), (7,5), (8,9)
(9,10), (9,11), (10,11), (11,2), (12,13), (13,14), (13,16), (14,15), (15,13)};
prime path coverage 主路径覆盖
TR = {(1,2,3,4,5,6,7),(1,2,3,4,5,6,8,9,10,11),(1,2,3,4,5,6,8,9,11),(1,2,3,4,5,9,10,11),(1,2,3,4,5,9,11),(1,2,12,13,16),(1,2,12,13,14,15),
(2,3,4,5,6,7),(2,3,4,5,6,8,9,10,11,2),(2,3,4,5,6,8,9,11,2),(2,3,4,5,6,8,9,11,2),(2,3,4,5,9,10,11,2),(2,12,13,14,15),
(2,12,13,16)
(5,6,7,5),(5,6,8,9,10,11,2,3,4,5),(5,6,8,9,11,2,3,4,5),(5,9,11,2,3,4,5),(5,9,10,11,2,3,4,5),
(6,7,5,6),(6,8,9,10,11,2,3,4,5,6),(6,8,9,11,2,3,4,5,6),(6,7,5,9,10,11,2,3,4),(6,7,5,9,11,2,3,4),(6,7,5,9,10,11,2,12,13,14,15),(6,7,5,9,11,2,12,13,14,15),(6,7,5,9,10,11,2,12,13,16),(6,7,5,9,11,2,12,13,16),
(7, 5,6 ,7),(7,5,6,8,9,10,11,2,3,4),(7,5,6,8,9,11,2,3,4),(7,5,6,8,9,10,11,2,12,13,14,15),(7,5,6,8,9,10,11,2,12,13,16),(7,5,6,8,9,11,2,12,13,14,15),(7,5,6,8,9,11,2,12,13,16),
(8,9,10,11,2,3,4,5,6,8),(8,9,11,2,3,4,5,6,7,8),
(9,10,11,2,3,4,5,6,8,9),(9,11,2,3,4,5,6,8,9),(9,10,11,2,3,4,5,9),(9,11,2,3,4,5,9),
(10,11,2,3,4,5,6,8,9,10),(10,11,2,3,4,5,9,10),
(11,2,3,4,5,6,8,9,10,11),(11,2,3,4,5,9,10,11),(11,2,3,4,5,6,8,9,11),(11,2,3,4,5,9,11),
(13,14,15,13),
(14,15,13,14),
(15,13,14,15)
}
构建一个主路径测试
package triangleTest; import static org.junit.Assert.*; import java.util.Arrays; import java.util.Collection; import org.junit.Before; import org.junit.Test; import org.junit.runner.RunWith; import org.junit.runners.Parameterized; import org.junit.runners.Parameterized.Parameters; @RunWith(Parameterized.class) public class PrimeTest { private String expected = ""; private int n; private Prime pr; public PrimeTest(int num, String expec){ n = num; expected = expec; } @Before public void setUp() throws Exception { pr = new Prime(); } @Test public void test(){ assertEquals(this.expected, pr.printPrimes(this.n)); } @Parameters public static Collection
结果: