st-homework3

Task: Use the following method printPrimes() for questions a-d.

1 /******************************************************* 2 * Finds and prints n prime integers 3 * Jeff Offutt, Spring 2003 4 ******************************************************/ 5 public static void printPrimes (int n) 6 { 7 int curPrime; // Value currently considered for primeness 8 int numPrimes; // Number of primes found so far. 9 boolean isPrime; // Is curPrime prime? 10 int [] primes = new int [MAXPRIMES]; // The list of prime numbers. 11 12 // Initialize 2 into the list of primes. 13 primes [0] = 2; 14 numPrimes = 1; 15 curPrime = 2; 16 while (numPrimes < n) 17 { 18 curPrime++; // next number to consider ... 19 isPrime = true; 20 for (int i = 0; i <= numPrimes-1; i++) 21 { // for each previous prime. 22 if (isDivisable(primes[i],curPrime)) 23 { // Found a divisor, curPrime is not prime. 24 isPrime = false; 25 break; // out of loop through primes. 26 } 27 } 28 if (isPrime) 29 { // save it! 30 primes[numPrimes] = curPrime; 31 numPrimes++; 32 } 33 } // End while 34 35 // Print all the primes out. 36 for (int i = 0; i <= numPrimes-1; i++) 37 { 38 System.out.println ("Prime: " + primes[i]); 39 } 40 } // end printPrimes

(a) Draw the control flow graph for the printPrimes() method.(b) Consider test cases t1 = (n = 3) and t2 = ( n = 5). Although these tour the same prime paths in printPrimes(), they do not necessarily find the same faults. Design a simple fault that t2 would be more likely to discover than t1 would.(c) For printPrimes(), find a test case such that the corresponding test path visits the edge that connects the beginning of the while statementto the for statement without going through the body of the while loop.(d) Enumerate the test requirements for node coverage, edge coverage,and prime path coverage for the graph for printPrimes().

---

 Answer:

(a)printPrimes方法的控制流图为：

(b)当MAXPRIMES = 4时，t1不能检查出错误，而t2则会发生数组越界错误。

(c)测试用例： n = 0 或 n = 1

(d)   节点覆盖： TR={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}

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

　　主路径覆盖: TR={ (1,2,3,4,5,6,7,9,10,11),

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

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

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

　　　　　　　　　 (1,2,12,13,14),

　　　　　　　　　 (1,2,12,13,15),

　　　　　　　　　 (1,2,3,4,5,6,8),　　　　　　　

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

　　　　　　　　　 (2,3,4,5,6,7,9,11,2),

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

　　　　　　　　　 (2,3,4,5,9,11.2), 

　　　　　　　　    (3,4,5,6,7,9,10,11,2,12,13,14),

　　　　　　　　    (3,4,5,6,7,9,11,2,12,13,14),

　　　　　　　　　 (3,4,5,6,7,9,10,11,2,12,13,15),

　　　　　　　　　 (3,4,5,6,7,9,11,2,12,13,15), 

　　　　　　　　　 (3,4,5,9,10,11,2,12,13,14),

　　　　　　　　　 (3,4,5,9,11,2,12,13,14),

　　　　　　　　　 (3,4,5,9,10,11,2,12,13,15),

　　　　　　　　　 (3,4,5,9,11,2,12,13,15), 　　　　　　　　　　

　　　　　　　　　 (5,6,8,5),  

　　　　　　　　　 (6,8,5,9,10,11,2,12,13,14),

　　　　　　　　　 (6,8,5,9,10,11,2,12,13,15),

　　　　　　　　　 (6,8,5,9,11,2,12,13,14),

　　　　　　　　　 (6,8,5,9,11,2,12,13,15), 　　　　　　　　

　 　　　　　　　　(13,14,13),

　　　　　　　　　 (14,13,15) }

 

转载于:https://www.cnblogs.com/jingyizhang/p/8645561.html

相关资源：数据结构—成绩单生成器