作业二

Below are two faulty programs. Each includes a test case that results in failure.
Answer the following questions (in the next slide) about each program.

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


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

 

解答:

Q1.Identify the fault.

  1. 数组第一个元素访问不到
  2. 这个程序无法找到最后一个零,只能找到第一个零

 

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

  1. Test:  x=null 程序不会执行对i的判断,就不会执行fault
  2. 不存在这样的样例,在i = 0被执行时,fault就执行了

 

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

  1. Test:  x=[2,3,4]; y=3 程序执行了fault,但没有造成failure
  2. Test:  x=[0,1] 程序执行了fault,但没有造成failure

 

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

  同第二题,因为error一直存在。

 

转载于:https://www.cnblogs.com/leonshaw-zh/p/6492387.html

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值