软件测试第三次作业

 a.

 

 b.当maxprimes= 1时,数组越界,发生错误

 c.t=(n=1)

d.点覆盖{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15 }

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

   主路径覆盖    {(1,2,3,4,5,6,7),
        (1,2,3,4,5,6,8,9,10,11),
        (1,2,3,4,5,6,8,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,15),
        (3,4,5,6,8,9,10,11,2,12,13,14),
        (3,4,5,6,8,9,11,2,12,13,14),
        (3,4,5,6,8,9,10,11,2,12,13,15),
        (3,4,5,6,8,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),
        (6,7,5,9,10,11,2,12,13,14),
        (6,7,5,9,11,2,12,13,14),
        (6,7,5,9,10,11,2,12,13,15),
        (6,7,5,9,11,2,12,13,15),
        (14,15,13,15),
        (13,14,13),
        (5,6,7,5),
        (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)}

 

    基于Junit及Eclemma (jacoco)实现一个主路径覆盖的测试

  测试结果如下:

  

  

     

 

  

转载于:https://www.cnblogs.com/fy3014218054/p/6550512.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值