一、Use the following method printPrimes for questions a–d.
/******************************************************* * 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 (curPrime%primes[i]==0) { // 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
(a) Draw the control flow graph for the printPrimes method.
(b) Considertestcasest1=(n=3)andt2=(n=5).Although these tourthe same prime paths in printPrimes, they do not necessarilyfind the same faults.Designasimplefaultthat t2 would bemorelikelytodiscover than t1 would.
答:将MAXPRIMES设置为4时,t2会发生数组越界错误,但t1不会发生错误。
(c) For printPrimes, 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循环。
(d) Enumerate the test requirements for node coverage, edge coverage, and prime path coverage for the graph for printPrimes.
点覆盖:{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}
边覆盖:{(1,2),(2,3),(3,4),(3,12),(4,5),(5,6),(6,9),(6,7),(7,8),(7,10),(8,9),(9,11),(9,3),(10,6),(11,3),(12,13),(13,14),(14,15),(15,13),(13,16)}
主路径覆盖:{(1,2,3,4,5,6,7,8,9,11),(1,2,3,4,5,6,7,10),(1,2,3,12,13,16),(1,2,3,12,13,14,15),(3,4,5,6,7,8, 9,11,3),(4,5,6,7,8, 9,11,3,4),(5,6,7,8, 9,11,3,4,5),(6,7,10,6),(6,7,8,9,11,3,4,5,6),(7,10,6,7),(7,8,9,11,3,4,5,6,7),(8,9,11,3,4,5,6,7,8),(9,11,3,4,5,6,7,8,9),(10,6,7,10),(11,3,4,5,6,7,8,9,11),(13,14,15,13),(14,15,13,14),(15,13,14,15),(14,15,13,16),(15,13,16)}
覆盖主路径共需四条测试路径:(1,2,3,4,5,6,7,8,9,11,3,4,5,6,7,8,9,11,3,4,5,6,7,10,6,7,10,6,9,3,12,13,14,15,13,14,15,13,16),(1,2,3,12,13,16),(1,2,3,12,13,14,15,13,16),(1,2,3,4,5,6,7,10,6,9,3,12,13,16)
二.基于Junit及Eclemma(jacoco)实现一个主路径覆盖的测试。
实验一中的三角形形状代码,要实现主路径覆盖,只需设计三种三角形的用例外加不是三角形的用例,即可达到覆盖率100%。