Question: The Program: Public int findMyLast (int[] x, int y) { For (int i=x.length-1; i>0; i--) { If (x[i]==y) {return I;} } Return -1; } Test

The Program:

Public int findMyLast (int[] x, int y) {

For (int i=x.length-1; i>0; i--) {

If (x[i]==y) {return I;}

}

Return -1;

}

Test Cases:

Case 1: x = [2, 3, 5], y=2;

Expect: findMyLast(x,y)==0

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

Expect: findMyLast(x,y)==3

Questions:

  1. For the given test case test1, identify the first error state. Be sure to describe the complete state.

  1. Please use the RIPR model to arrive at a test case where a fault being revealed.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

Answer the question about the program public int findLast (int] x, int y) Effects. If x-=null throw NullPointerException // else return the index of the last element /l in x that equals y. // If no...

Q:

KH Find last index of element * Cparam x array to search * Cparam y value to look for * Greturn last index of y in x; -1 if absent * Qthrows NullPointerException if x is null public int findLast (int...

Q:

Software Testing: 6. Consider the findLast() method. Consider the AOR3 and the ROR4 mutation operators. # Find last index of element (a) What is the minimum number of mutants necessary for coverage...

Q:

Answer the question about the 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...

Q:

/** * Count positive elements * * @param x array to search * @return count of positive elements in x * @throws NullPointerException if x is null */ public int countPositive (int[] x) { int count = 0;...

Q:

Answer the question about the program public int findLast (int] x, int y) WEffects: If x--null throw NullPointerException // else return the index of the last element // in x that equals y. // If no...

Q:

Java Data Structures and Big-Oh Performance Estimation Create a class that can be used to test data structure - similar to the StudentA.java example found shown below: StudentA.java import...

Q:

Which one is a fault in the following 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...

Q:

I need help writing the MoveWarrior method for this project. Here is the Problem: Problem: In an effort to win a coding competition, you decided to code awesome Obstacle Warrior game. The game is...

Q:

Below is a faulty program which includes a test case that results in failure. Answer the following questions about the program public int findLast (int[] x, int y) { //Effects: If x-null throw...

Q:

Use the frequency distribution from Exercise 23 in Section 2-2 to construct a frequency polygon. Applying a loose interpretation of the requirements for a normal distribution, do the magnitudes...

Q:

Write a short note on corporate parenting.

Q:

Refer to the information for Rosie-Lee Company. The following balance sheets and income statement were taken from the records of Rosie-Lee Company: Additional transactions were as follows: a. Sold...

Q:

A random sample of 43 biology students in a science program are selected for a study. Of those selected, only 27 passed the mid term exam. At the 5% significance level, is there sufficient evidence...

Q:

1. The Kings Speech centers on Alberts address to the British people on September 3, 1939, at the outbreak of World War II, audio recordings of which are available online. Listen to them, and...

Q:

Presentations Approaches to Conveying Information

Q:

2. While in class, select a partner and give a one- to two-minute impromptu speech on a topic of your choice. Your partner will write down both negative and positive feedback to share with you, and...