软件测试第三次作业
一.Use the following method printPrimes() for questions a–d.
(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 necessarily find the same faults.Designasimplefaultthat t2 would bemorelikelytodiscover than t1 would.
t1=(n=3),t2=(n=5).当数组越界时,t2更能发现问题。
(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时,程序跳过循环
(d) Enumerate the test requirements for node coverage, edge coverage, and prime path coverage for the graph for printPrimes().
node coverage:
{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}
edge coverage:
{(1,2),(2,3),(3,4),(4,5),(5,6),(6,8),(8,5),(6,7),(7,9),(5,9),(9,10),(9,11),(10,11),(11,2),(2,12),(12,13),(13,14),(14,15),(15,13),(13,16)}
prime path coverage:
{(1,2,3,4,5,6,8),(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,11),(1,2,3,4,5,9,10,11),(5,6,8,5),(6,8,5,6),(8,5,6,8),(8,5,6,7,9,11),(8,5,6,7,9,10,11),(1,2,12,13,16),(1,2,12,13,14,15),(13,14,15,13),(14,15,13,14),(15,13,14,15),(14,15,13,16),(15,13,16)}
二.基于Junit及Eclemma(jacoco)实现一个主路径覆盖的测试。
主路径覆盖的测试,详见我的博客“软件测试第一次上机实验报告”