第二次作业

在本次作业中，根据两段程序，设计了测试用例，并实现所要求的情况，以下是要求以及我的答案。

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

 Identify the fault.  If possible, identify a test case that does not execute the fault. (Reachability)  If possible, identify a test case that executes the fault, but does not result in an error state.  If possible identify a test case that results in an error, but not a failure.

1.1 在for循环中，i的判断条件是错误的，应该改为i>=0
1.2 x == null y为任意值
1.3 [3,2,5] y = 5,即y的值不在x的第一位
1.4 [2,3,5] y=1,即y的值不在x中

 

2.1 for循环应该逆序搜索，如果正序搜索在某些测试用例中无法搜索到最后一个0，即把for循环判断条件改为
    for(int i=x.length-1;i>=0;i--)
2.2 x == null
2.3 数组中只有一个元素
2.4 [0,1] ,即x中只有一个0，或者没有0

 

转载于:https://www.cnblogs.com/gaigaihe/p/6531021.html