题目要求：

a)       流程图如下：

b)    Consider test cases ti = (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

Answer:如果将MAXPRIMES的值设为4那么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.

Answer:将n的值设为1

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

Answer:

点覆盖： {1，2，3，4，5，6，7，8，9，10，11，12，13，14，15，16}

边覆盖：{{1,2}，{2,3}，{2,12}，{3,4}，{4,5}，{4,11}，{5,6}，{5,10}，{6,7}，{7,8}，{7,9}，{8,2}，{9,2}，{10,4}，{11，7}，{12,13}，{13,14}，{13,16}，{14，15}，{15,13}}

主路径覆盖:

{{1,2,3,4,5,6,7,8},

{1,2,3,4,5,6,7,9},

{1,2,3,4,5,10},

{1,2,3,4,11,7,8},

{1.2.3.4.11.7.9},

{1,2,12,13,14,15},

{1,2,12,13,16},

{2,3,4,5,6,7,8,2},

{2,3,4,5,6,7,9,2},

{2,3,4,11,7,8,2},

{2,3,4,11,7,9,2},

{3,4,5,6,7,8,2,12,13,14,15},

{3,4,5,6,7,8,2,12,13,16},

{3,4,5,6,7,9,2,12,13,14,15},

{3,4,5,6,7,9,2,12,13,16},

{4,5,10,4},

{4,5,6,7,8,2,3,4},

{4,5,6,7,9,2,3,4},

{4,11,7,8,2,3,4},

{4,11,7,9,2,3,4},

{5,10,4,5},

{5,6,7,8,2,3,4,5},

{5,6,7,9,2,3,4,5},

{6,7,8,2,3,4,5,6},

{6,7,9,2,3,4,5,6},

{7,8,2,3,4,5,6,7},

{7,9,2,3,4,5,6,7},

{7,8,2,3,4,11,7},

{7,9,2,3,4,11,7},

{8,2,3,4,5,6,7,8},

{8,2,3,4,11,7,8},

{9,2,3,4,5,6,7,9},

{9,2,3,4,11,7,9},

{10,4,5,10},

{11,7,8,2,3,4,11},

{11,7,9,2,3,4,11},

{13,14,15,13},

{14,15,13,14},

{15,13,14,15},

}

}

测试代码如下：

测试结果及覆盖路径：

还有什么疑问可以交流交流