软件测试作业二

1.

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

answer:

1)  Fault:

for循环中的i>0使循环时取不到x[0]的值


2) Not execute the fault.

test: x = NULL, y=2

 

3) Executes the fault, but does not result in an error state.

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

 

4)Results in an error, but not a failure.

 

testx=[1,2,3],y=4

 

 

2.
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

 

 

 

answer:

 

1)  Fault:

 

 

for循环会导致返回的是第一个等于0的下标


2) Not execute the fault.

 

test: x = NULL

 

 

3) Executes the fault, but does not result in an error state.

 

 

test:x=[0,1,2]

 

 

4)Results in an error, but not a failure.

 

 

test:x=[2,0,3]

 

 

转载于:https://www.cnblogs.com/lxc017/p/6491411.html

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值