Software Testing!

Below are four faulty programs. Each includes test inputs that result in failure. Answer the following question about each program.

Here are the questions to answer for each of the above codes.

(a) Explain what is wrong with the given code. Describe the fault precisely by proposing the modification to the code.

(b) If possible, give a test case that does not execute the fault. If not briefly explain why not.

(c) If possible, give a test case that executes the fault, but does not result in an error state. If not, briefly explain why not.

(d) If possible give a test case that results in an error, but not a failure. If not, briefly explain why not. Hint: Dont forget about the program counter.

(e) For the given test case, describe the first error state. Be sure to describe the complete state.

(f) Implement your repair and verify that the given test now produces the expected output. Submit a screen printout or other evidence that your new program works.

Thanks.

* Find last index of element * Find last index of zero * @param x array to search " @return last index of 0 in x; -1 if absent "@param x array to search @param y value to look for " @return last index of y in x; -1 if absent @throws NullPointerException if x is null " @throws NullPointerException if x is null public int findLast (int[] x, int y) public static int lastZero (int[] x) for (int i-x.length-1; > 0; --) for (int = 0; 1 0) count++; count++; return count; return count; // test: x [-4, 2, 0, 2]. Expected-2 // Book website: CountPositive.java // Book website: CountPositive Test.java // test: x- [-3, -2, 0, 1, 4]; Expected 3 // Book website: OddOrPos.java // Book website: OddOrPosTest.java