标签：
课程复习：通过这几节课的学习，我知道了什么是node，edge，edge pair；明白了什么是分支覆盖和边界值，初步能够能据不同情况分析边界值。
作业：1.P63 7
1）control flow graph
2）令MAXPRIMES=3，t2 = （n = 5）数组越界，而t1 = （n = 3）不会越界。
3）通过edge（2，12），即可不经过while循环，n=1。
4）点覆盖：{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），（5，6），（6,7），（6,8），（7,5），（8,9），（5,9），
（9,10），（9,11），（10,11），（11,2），（12,13），（13,14），（14,15），（15,13）， （13,16）}
主路径覆盖：TR= {[1,2,3,4,5,6,8,9,10,11],[1,2,3,4,5,6,8,9,11],[1,2,3,4,5,6,7],[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,8,9,10,11,2],[2,3,4,5,6,8,9,11,2],[2,3,4,5,9,10,11,2],[2,3,4,5,9,11,2],[3,4,5,9,11,2,3],
[3,4,5,6,8,9,10,11,2,12,13,16],[3,4,5,6,8,9,10,11,2,12,13,14,15],[3,4,5,6,8,9,11,2,12,13,16], [3,4,5,9,10,11,2,3],
[3,4,5,6,8,9,11,12,13,14,15],[3,4,5,9,10,11,2,12,13,16],[3,4,5,9,10,11,2,12,13,14,15],[3,4,5,9,11,2,12,13,16],
[3,4,5,9,11,2,12,13,14,15],[3,4,5,6,8,9,10,11,2,3],[3,4,5,6,8,9,11,2,3],[4,5,6,8,9,10,11,2,3,4],[4,5,6,8,9,11,2,3,4],
[4,5,9,10,11,2,3,4],[4,5,9,11,2,3,4],[5,6,8,9,10,11,2,3,4,5],[5,6,8,9,11,2,3,4,5],[5,9,10,11,2,3,4,5],[5,9,11,2,3,4,5],
[5,6,7,5],[6,8,9,10,11,2,3,4,5,6],[6,8,9,11,2,3,4,5,6],[6,7,5,6],[6,7,5,9,10,11,2,3,4,5,6],[6,7,5,9,11,2,3,4,5,6],
[6,7,5,9,10,11,2,12,13,16],[6,7,5,9,10,11,2,14,15],[6,7,5,9,11,2,12,13,16],[6,7,5,9,11,2,14,15],[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,16],[7,5,6,8,9,10,11,2,12,13,14,15],
[7,5,6,8,9,11,2,12,13,16],[7,5,6,8,9,11,2,12,13,14,15],[8,9,10,11,2,3,4,5,6,8],[8,9,11,2,3,4,5,6,8],[9,11,2,3,4,5,6,8,9],
[9,10,11,2,3,4,5,6,8,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],[14,15,13,16],[15,13,14,13],[15,13,16]}
2. Junit进行主路径覆盖测试
标签：
原文地址：http://www.cnblogs.com/chonny/p/5341541.html
