软件测试作业2

软件测试作业1

曲星明 3014218129

 

 

public int findLast (int[] x, int y) {
//Effects: If x==null throw
NullPointerException
// else return the index of the last element
// in x that equals y.
// If no such element exists, return -1 for (int i=x.length-1; i > 0; i--)
{
if (x[i] == y)
{
return i;
}
}
return -1;
}
// test: x=[2, 3, 5]; y = 2
// Expected = 0

 

Fault: i>=0

 

 

Error:  i is 1, not 0, on the last iteration

 

Actual:-1

Failure: return -1 而不是0

 

if possible, identify a test case that does not execute the fault. (Reachability)

x=NULL;

If possible, identify a test case that executes the fault, but does not result in an error state.

test: x=[3,2,5]; y=2

If possible identify a test case that results in an error, but not a failure.

test: x=[2,3,5]; y=20

 

 

 

public static int lastZero (int[] x) {
//Effects: if x==null throw
NullPointerException
// else return the index of the LAST 0 in x.
// Return -1 if 0 does not occur in x for (int i = 0; i < x.length; i++)
{
if (x[i] == 0)
{
return i;
}
} return -1;
}


// test: x=[0, 1, 0]
// Expected = 2

 

Fault:遇到第一个0就return而不是最后一个才return

 

 

if possible, identify a test case that does not execute the fault. (Reachability)

x=NULL;

 

If possible, identify a test case that executes the fault, but does not result in an error state.

test: x=[3,2,9];

 

If possible identify a test case that results in an error, but not a failure.

test: x=[0,2,9];

 

转载于:https://www.cnblogs.com/quxingming/p/6443019.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值