软件测试 第三次作业

(a) 将就一下锻炼颈椎吧，废了半天劲也没把图片正过来

(b) 改为isDivisiable( primes[0], curPrime)

(c) n = 1

(d) Node Coverage: { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 }

Edge Coverage: { (0,1), (1,2), (1,10), (2,3), (3,4), (3,7), (4,5), (4,6), (6,3), (5,7), (7,8), (7,9), (8,9), (9,1), (10,11), (11,12), (11,14), (12,13), (13,11) }

Prime Path Coverage: {

[0, 1, 2, 3, 4, 5, 7, 8, 9], 

[0, 1, 2, 3, 4, 5, 7, 9], 

[0, 1, 2, 3, 4, 6], 

[0, 1, 2, 3, 7, 8, 9], 

[0, 1, 2, 3, 4, 5, 7, 8, 9], 

[0, 1, 2, 3, 7, 9], 

[0, 1, 10, 11, 12, 13], 

[0, 1, 10, 11, 14], 

[2, 3, 4, 5, 7, 8, 9, 1, 10, 11, 14], 

[2, 3, 4, 5, 7, 8, 9, 1, 10, 11, 12, 13], 

[2, 3, 4, 5, 7, 9, 1, 10, 11, 14], 

[2, 3, 4, 5, 7, 9, 1, 10, 11, 12, 13], 

[2, 3, 7, 8, 9, 1, 10, 11, 14], 

[2, 3, 7, 8, 9, 1, 10, 11, 12, 13], 

[2, 3, 7, 9, 1, 10, 11, 14], 

[2, 3, 7, 9, 1, 10, 11, 12, 13], 

[4, 6, 3, 7, 8, 9, 1, 10, 11, 14], 

[4, 6, 3, 7, 8, 9, 1, 10, 11, 12, 13], 

[4, 6, 3, 7, 9, 1, 10, 11, 14], 

[4, 6, 3, 7, 9, 1, 10, 11, 12, 13], 

[12, 13, 11, 14], 

[1, 2, 3, 4, 5, 7, 8, 9, 1], 

[1, 2, 3, 4, 5, 7, 9, 1], 

[1, 2, 3, 7, 8, 9, 1], 

[1, 2, 3, 7, 1], 

[3, 4, 6, 3], 

[11, 12, 13, 11] }

转载于:https://www.cnblogs.com/luvianlan/p/5329658.html