Given the starter code and instructions for 3 methods.How can I implement those 3 methods into the code? public abstract class Ride {protected final String name;protected double profits;protected int lastInspection;protected String[] passengers;public Ride (String id, int runsSince Inspection, String[] passengers) {this.name = name;this.profits0;}=}this.lastInspection = 0;this.passengers = new String[passengers.length];for (int i = 0; i < passengers.length; i++) {this.passengers[i] = passengers [i];}public Ride (String name, String[] passengers) {this (name, 0, passengers);public abstract boolean ableToRun(int numberofRuns);public abstract boolean checkRide (String[] components);public abstract double costPerPassenger (int numberOfStops);public abstract boolean addPassengers(int numberOfStops, String[] newPassengers); f) chargePassengeri)ii)iii)g) removePassengeri)ii)iii)iv)v)h) Equalsi)Takes in an int number of stops and increases earnings accordingly.This method does not return anything.This method should not be allowed to be overridden.ii)iii)iv)Takes in a String representing the name of a passenger.If the name is not in the passenger array, return false.If the name is in the passenger array, remove the passenger by setting that index to null and returntrue.This method should only remove the first occurrence of the named passenger, case-insensitive.Assume that the input name is not null.Overrides the equals method from Object.Two Ride objects are equal if they have equal name and lastInspection.Your implementation of the equals method must be symmetric.I.e., for two non-null objects a and b, a.equals(b) == b.equals(a) must always be true.

As per the given information we need to implement the 3 methods called…

Answered: I implement those 3 methods into the…

Engineering

Computer Science

I implement those 3 methods into the code?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.4: Arrays As Arguments

Problem 6E: (Electrical eng.) Write a program that declares three one-dimensional arrays named volts, current,...

See similar textbooks

Similar questions

Exercise 1: //The max function the max between a and b, it returns a if a == //b public double max(double a, double b); //The mult function returns the result of a * b public double mult(double a, double b); //The exist in array function returns the index of the element //‘a’ if //‘a’ exist in array ‘arr’ otherwise returns ‘-1’ public int existsInArray(int [] arr, int a); //Are array equals method compares two arrays and returns true // if the elements of array ‘a’ are equal to elements of array // ‘b’, element by element. If equals it returns 0, it returns - // 1 if not public int areArrayEquals(int [] a, int [] b); Devise four executable test cases for every method in the JUnit notation. See the attached handout for a refresher on the notation.
void showArray ( int a[ ], int size ); // shows the array in the format "int a [ ] = { 3, 7, 4, ... ,5, 6, 3} void showReverse ( int a[ ], int size ); // shows the array in reverse "int a [ ] = { 3, 6, 5, ... , 4, 7, 3 } " int lowest ( int a[ ], int size ); // finds and returns the lowest value in the array (should be 3) int highest ( int a[ ], int size ); // finds and returns the highest value in the array (should be 7) int sumArray ( int a[ ], int size ); // calculates and returns the sum of all values in the array float averageVal ( int a[ ], int size ); // calculates and returns the average of all values in the array int count5 ( int a[ ], int size ); // returns how many times the number 5 appears in the array int firstMinusLast ( int a[ ], int size ); // returns the difference b/w the First and Last Array Element void showBeforeIndex( int a [ ], int index); // shows all array values before a specific index void done…
After the final exam, the following information is observed about securing “A” grade PF class id 01 gets 4 A grades with scores 87 88 89 87 PF class id 02 gets 2 A grades with scores 90 87 PF class id 03 gets 3 A grades with scores 91 89 87 Write a program to store the above 3 class scores in Jagged Array by initialing all these values , then program will print the following information on screen. 1: Student with highest marks in each class 2: Student with highest marks in all 3 classes Solve with C#
6.29 LAB: Remove all even numbers from an array Use Java programming. Write the removeEvens() method, which receives an array of integers as a parameter and returns a new array of integers containing only the odd numbers from the original array. The main program outputs values of the returned array. Hint: If the original array has even numbers, then the new array will be smaller in length than the original array and should have no blank elements. Ex: If the array passed to the removeEvens() method is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the method returns and the program output is: [1, 3, 5, 7, 9] Ex: If the array passed to the removeEvens() method is [1, 9, 3], then the method returns and the program output is: [1, 9, 3] import java.util.Arrays; public class LabProgram { public static int[] removeEvens(int [] nums) { /* Type your code here */} public static void main(String[] args) { int [] input = {1,2,3,4,5,6,7,8,9};int [] result = removeEvens(input); // Helper method…
The following code creates a small phone book. An array is used to storea list of names and another array is used to store the phone numbers thatgo with each name. For example, Michael Myers’ phone number is 333-8000 and Ash Williams’ phone number is 333-2323. Write the functionlookupName so the code properly looks up and returns the phone numberfor the input target name.int main(){using namespace std;string names[] = {"Michael Myers","Ash Williams","Jack Torrance","Freddy Krueger"};string phoneNumbers[] = {"333-8000","333-2323","333-6150","339-7970"};string targetName, targetPhone;char c;do{cout << "Enter a name to find the "<< "corresponding phone number."<< endl;getline(cin, targetName);targetPhone = lookupName(targetName,names, phoneNumbers,4);if (targetPhone.length() > 0)cout << "The number is: "<< targetPhone << endl;elsecout << "Name not found. "<< endl;cout << "Look up another name? (y/n)"<< endl;cin >>…
a) create a method that accepts a 2D array and shuffles it values (like playing cards) b) test your method from main: print your 2D array before and after c) create a similar method that will return the array. Call and test it from main .
It is required to create a dynamic array that can store 10 integers. Which of the following will work? Group of answer choices int array=(int*) malloc(10*sizeof(int)); int* array=(int*) malloc(10*sizeof(int)); int array=(int) malloc(10*sizeof(int)); int* array=malloc(10*sizeof(int));
//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }
PART A: Note: The following code is written only in main -- you assume there is an array bag and you are not adding any methods to that bag. Write the main program to create two array bags of type string. Place 5 strings of your choice in the first bag and 5 strings (of your choice) in the second bag. Your program must:1) determine if there are any strings in the first bag that appears in the second bag as well. If there are, print there are repeated strings. Else print the bags have unique values. 2) Print the content of the both bags and if there are repeated values, print that value only once. PART B: Create two linkedBag objects of type string in main. Place 5 strings in the first bag and five strings in the second bag. Then your code must test if the two linkedBag objects are equal or not. You must traverse both linkedBags and test each items to see if they are the same. Then you must display a message saying the two linkedBags are the same or different. PART C: Write a…
Complete the following Java method. This method takes in an array of Strings. The method's task is to find out how many times the most common character frequency appears in all of the array's Strings. As an example, for the array ["mouse", "cat", "dog"], the method should return 9, since the characters "m", "u", "s", "e", "c", "a", "t", "d", and "g" appear only once and this frequency (1) appears 9 times. The character "o", appears twice. This frequency (2) appears only once. Therefore, 9 must be returned. Also, if a character appears multiple times in one String, you must count every occurrence. For example, in the word "houses", the character "s" appears twice. Therefore, each occurrence of "s" must be counted. If there is a tie at the completion of the method, you must still return how many times the most frequent character frequency occurred. Furthermore, in your implementation, you must make use of the Java Class Library's HashMap class in order to map particular characters to…
What is the value of a[5] if an array is initialized as follows: int a[10]={15}; 0 5 10 15
Shift Right k Cells (Use Python) Consider an array named source. Write a method/function named shifRight( source, k) that shifts all the elements of the source array to the right by 'k' positions. You must execute the method by passing an array and number of cells to be shifted. After calling the method, print the array to show whether the elements have been shifted properly. Example: source=[10,20,30,40,50,60] shiftRight(source,3) After calling shiftRight(source,3), printing the array should give the output as: [ 0,0,0,10,20,30 ]