Please provide solution in JAVA with Driver class using all the methods Please p
ID: 3702142 • Letter: P
Question
Please provide solution in JAVA with Driver class using all the methods
Please provide solution in JAVA with Driver class using all the methods
Please provide solution in JAVA with Driver class using all the methods
Please provide solution in JAVA with Driver class using all the methods
Please provide solution in JAVA with Driver class using all the methods
Lab12 Array Class sa Pamamia UML Standard Edion Sa Arrayos Unis +find Highest Value (array: int []) : int +findHighestValue (array : double []): double findHighestValue (array: String II) : String +findPositionHighestValue(array : int ) : int +findPosition HighestValue(array : double (: int +find Position HighestValue(array : String (l): int +findLowestValue(array : String (l): String, +findLowestValue(array : int II) : int +findLowestValue(array : double []) : double +sum(array : int i) : int +sum(array : double 1) : double taverage array : int ) : double taverage array : double []) : double +copy Array(array : int i) : int +copy Array(array : double ll) : double +copy Array(array : String (l): String +compareArray(firstArray : int , secondArray : int []) : boolean +compareArray(firstArray : double, secondArray : double []): boolean +compareArray (firstArray: String I, secondArray : String []) : boolean +sortArray(array : int l): void +sortArray(array : double 1) : void +sortArray(array : String il)void esearchArray (array : int I. value : int): int +searchArray(array : double I. value: double): int +searchArray(array : String value: String) : intExplanation / Answer
Here is your solution:-
TestMethods.java (interface)
/**
* @author Lokesh Kumar
*
*/
public interface TestMethods {
/**
* @param array
* @return
*/
public int findHighestValue(int[] array);
/**
* @param array
* @return
*/
public double findHighestValue(double[] array);
/**
* @param array
* @return
*/
public String findHighestValue(String[] array);
/**
* @param array
* @return
*/
public int findPositionHighestValue(int[] array);
/**
* @param array
* @return
*/
public int findPositionHighestValue(double[] array);
/**
* @param array
* @return
*/
public int findPositionHighestValue(String[] array);
/**
* @param array
* @return
*/
public String findLowestValue(String[] array);
/**
* @param array
* @return
*/
public int findLowestValue(int[] array);
/**
* @param array
* @return
*/
public double findLowestValue(double[] array);
/**
* @param array
* @return
*/
public int sum(int[] array);
/**
* @param array
* @return
*/
public double sum(double[] array);
/**
* @param array
* @return
*/
public double average(int[] array);
/**
* @param array
* @return
*/
public double average(double[] array);
/**
* @param array
* @return
*/
public int[] copyArray(int[] array);
/**
* @param array
* @return
*/
public double[] copyArray(double[] array);
/**
* @param array
* @return
*/
public String[] copyArray(String[] array);
/**
* @param firstArray
* @param secondArray
* @return
*/
public boolean compareArray(int[] firstArray, int[] secondArray);
/**
* @param firstArray
* @param secondArray
* @return
*/
public boolean compareArray(double[] firstArray, double[] secondArray);
/**
* @param firstArray
* @param secondArray
* @return
*/
public boolean compareArray(String[] firstArray, String[] secondArray);
/**
* @param array
*/
public void sortArray(int[] array);
/**
* @param array
*/
public void sortArray(double[] array);
/**
* @param array
*/
public void sortArray(String[] array);
/**
* @param array
* @param value
* @return
*/
public int searchArray(int[] array, int value);
/**
* @param array
* @param value
* @return
*/
public int searchArray(double[] array, double value);
/**
* @param array
* @param value
* @return
*/
public int searchArray(String[] array, String value);
}
DriverClass.java
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.stream.DoubleStream;
import java.util.stream.IntStream;
/**
* @author Lokesh Kumar
*
*/
public class DriverClass implements TestMethods {
int[] firstIntArray = {1,5,6,9,78,76,4};
int[] secondIntArray = {8,6,77,8,7,6,2};
double[] firstDoubleArray = {1.5,5.6,6.2,9.6,7.8,9.5,4.2};
double[] secondDoubleArray = {6.5,2.6,7.2,3.6,4.8,10.5,11.2};
String[] firstStringArray = {"3", "5", "6.9", "8.7", "5"};
String[] secondStringArray = {"3", "5", "6.9", "8.7", "5"};
/**
* @param array
* @return
*/
@Override
public int findHighestValue(int[] array) {
List<Integer> list = new ArrayList<Integer>();
for (int i = 0; i < array.length; i++) {
list.add(array[i]);
}
return Collections.max(list);
}
/**
* @param array
* @return
*/
@Override
public double findHighestValue(double[] array) {
List<Double> list = new ArrayList<Double>();
for (int i = 0; i < array.length; i++) {
list.add(array[i]);
}
return Collections.max(list);
}
/**
* @param array
* @return
*/
@Override
public String findHighestValue(String[] array) {
List<Double> list = new ArrayList<Double>();
for (int i = 0; i < array.length; i++) {
list.add(Double.valueOf(array[i]));
}
return Collections.max(list).toString();
}
/**
* @param array
* @return
*/
@Override
public int findPositionHighestValue(int[] array) {
int position = 0;
for (int i = 1; i < array.length; i++) {
if (array[i] > array[position])
position = i;
}
return position;
}
/**
* @param array
* @return
*/
@Override
public int findPositionHighestValue(double[] array) {
int position = 0;
for (int i = 1; i < array.length; i++) {
if (array[i] > array[position])
position = i;
}
return position;
}
/**
* @param array
* @return
*/
@Override
public int findPositionHighestValue(String[] array) {
int position = 0;
for (int i = 1; i < array.length; i++) {
if (Double.valueOf(array[i]) > Double.valueOf(array[position]))
position = i;
}
return position;
}
/**
* @param array
* @return
*/
@Override
public String findLowestValue(String[] array) {
List<Double> list = new ArrayList<Double>();
for (int i = 0; i < array.length; i++) {
list.add(Double.valueOf(array[i]));
}
return Collections.min(list).toString();
}
/**
* @param array
* @return
*/
@Override
public int findLowestValue(int[] array) {
List<Integer> list = new ArrayList<Integer>();
for (int i = 0; i < array.length; i++) {
list.add(array[i]);
}
return Collections.min(list);
}
/**
* @param array
* @return
*/
@Override
public double findLowestValue(double[] array) {
List<Double> list = new ArrayList<Double>();
for (int i = 0; i < array.length; i++) {
list.add(array[i]);
}
return Collections.min(list);
}
/**
* @param array
* @return
*/
@Override
public int sum(int[] array) {
return IntStream.of(array).sum();
}
/**
* @param array
* @return
*/
@Override
public double sum(double[] array) {
return DoubleStream.of(array).sum();
}
/**
* @param array
* @return
*/
@Override
public double average(int[] array) {
int sum = IntStream.of(array).sum();
double average = sum / array.length;
return average;
}
/**
* @param array
* @return
*/
@Override
public double average(double[] array) {
double sum = DoubleStream.of(array).sum();
double average = sum / array.length;
return average;
}
/**
* @param array
* @return
*/
@Override
public int[] copyArray(int[] array) {
int b[] = new int[array.length];
for (int i = 0; i < array.length; ++i) {
b[i] = array[i];
}
return b;
}
/**
* @param array
* @return
*/
@Override
public double[] copyArray(double[] array) {
double b[] = new double[array.length];
for (int i = 0; i < array.length; ++i) {
b[i] = array[i];
}
return b;
}
/**
* @param array
* @return
*/
@Override
public String[] copyArray(String[] array) {
String b[] = new String[array.length];
for (int i = 0; i < array.length; ++i) {
b[i] = array[i];
}
return b;
}
/**
* @param firstArray
* @param secondArray
* @return
*/
@Override
public boolean compareArray(int[] firstArray, int[] secondArray) {
if (Arrays.equals(firstArray, secondArray)) {
return true;
} else {
return false;
}
}
/**
* @param firstArray
* @param secondArray
* @return
*/
@Override
public boolean compareArray(double[] firstArray, double[] secondArray) {
if (Arrays.equals(firstArray, secondArray)) {
return true;
} else {
return false;
}
}
/**
* @param firstArray
* @param secondArray
* @return
*/
@Override
public boolean compareArray(String[] firstArray, String[] secondArray) {
Set<String> set = new HashSet<String>(Arrays.asList(secondArray));
boolean result = Arrays.stream(firstArray).anyMatch(set::contains);
return result;
}
/**
* @param array
*/
@Override
public void sortArray(int[] array) {
Arrays.sort(array);
}
/**
* @param array
*/
@Override
public void sortArray(double[] array) {
Arrays.sort(array);
}
/**
* @param array
*/
@Override
public void sortArray(String[] array) {
Arrays.sort(array);
}
/**
* @param array
* @param value
* @return
*/
@Override
public int searchArray(int[] array, int value) {
int j = -1;
for (int i = 0; i < array.length; i++) {
if (array[i] == value) {
j = i;
break;
}
}
return j;
}
/**
* @param array
* @param value
* @return
*/
@Override
public int searchArray(double[] array, double value) {
int j = -1;
for (int i = 0; i < array.length; i++) {
if (array[i] == value) {
j = i;
break;
}
}
return j;
}
/**
* @param array
* @param value
* @return
*/
@Override
public int searchArray(String[] array, String value) {
int j = -1;
for (int i = 0; i < array.length; i++) {
if (array[i].equals(value)) {
j = i;
break;
}
}
return j;
}
public static void main(String[] args) {
DriverClass dClass = new DriverClass();
System.out.println("Highest Value in "+Arrays.toString(dClass.firstIntArray)+" is "+dClass.findHighestValue(dClass.firstIntArray));
System.out.println("Highest Value in "+Arrays.toString(dClass.firstDoubleArray)+" is "+dClass.findHighestValue(dClass.firstDoubleArray));
System.out.println("Highest Value in "+Arrays.toString(dClass.firstStringArray)+" is "+dClass.findHighestValue(dClass.firstStringArray));
System.out.println("-----------------------------------------------");
System.out.println("Highest Value position in "+Arrays.toString(dClass.firstIntArray)+" at "+dClass.findPositionHighestValue(dClass.firstIntArray));
System.out.println("Highest Value position in "+Arrays.toString(dClass.firstDoubleArray)+" at "+dClass.findPositionHighestValue(dClass.firstDoubleArray));
System.out.println("Highest Value position in "+Arrays.toString(dClass.firstStringArray)+" at "+dClass.findPositionHighestValue(dClass.firstStringArray));
System.out.println("-----------------------------------------------");
System.out.println("Lowest Value in "+Arrays.toString(dClass.firstIntArray)+" is "+dClass.findLowestValue(dClass.firstIntArray));
System.out.println("Lowest Value in "+Arrays.toString(dClass.firstDoubleArray)+" is "+dClass.findLowestValue(dClass.firstDoubleArray));
System.out.println("Lowest Value in "+Arrays.toString(dClass.firstStringArray)+" is "+dClass.findLowestValue(dClass.firstStringArray));
System.out.println("-----------------------------------------------");
System.out.println("Sum of an array "+Arrays.toString(dClass.firstIntArray)+" is "+dClass.sum(dClass.firstIntArray));
System.out.println("Sum of an array "+Arrays.toString(dClass.firstDoubleArray)+" is "+dClass.sum(dClass.firstDoubleArray));
System.out.println("-----------------------------------------------");
System.out.println("Average of an array "+Arrays.toString(dClass.firstIntArray)+" is "+dClass.average(dClass.firstIntArray));
System.out.println("Average of an array "+Arrays.toString(dClass.firstDoubleArray)+" is "+dClass.average(dClass.firstDoubleArray));
System.out.println("-----------------------------------------------");
System.out.println("Copy of an array "+Arrays.toString(dClass.firstIntArray)+" is "+Arrays.toString(dClass.copyArray(dClass.firstIntArray)));
System.out.println("Copy of an array "+Arrays.toString(dClass.firstDoubleArray)+" is "+Arrays.toString(dClass.copyArray(dClass.firstDoubleArray)));
System.out.println("Copy of an array "+Arrays.toString(dClass.firstStringArray)+" is "+Arrays.toString(dClass.copyArray(dClass.firstStringArray)));
System.out.println("-----------------------------------------------");
System.out.println("Comparing these two arrays "+Arrays.toString(dClass.copyArray(dClass.firstIntArray))+" and "+Arrays.toString(dClass.copyArray(dClass.secondIntArray)) +" is " + dClass.compareArray(dClass.firstIntArray, dClass.secondIntArray));
System.out.println("Comparing these two arrays "+Arrays.toString(dClass.copyArray(dClass.firstDoubleArray))+" and "+Arrays.toString(dClass.copyArray(dClass.secondDoubleArray)) +" is " + dClass.compareArray(dClass.firstDoubleArray, dClass.secondDoubleArray));
System.out.println("Comparing these two arrays "+Arrays.toString(dClass.copyArray(dClass.firstStringArray))+" and "+Arrays.toString(dClass.copyArray(dClass.secondStringArray)) +" is " + dClass.compareArray(dClass.firstStringArray, dClass.secondStringArray));
System.out.println("-----------------------------------------------");
System.out.println(Arrays.toString(dClass.firstIntArray) +" After Sorted");
dClass.sortArray(dClass.firstIntArray);
System.out.println(Arrays.toString(dClass.firstIntArray));
System.out.println(Arrays.toString(dClass.firstDoubleArray) +" After Sorted");
dClass.sortArray(dClass.firstDoubleArray);
System.out.println(Arrays.toString(dClass.firstDoubleArray));
System.out.println(Arrays.toString(dClass.firstStringArray) +" After Sorted");
dClass.sortArray(dClass.firstStringArray);
System.out.println(Arrays.toString(dClass.firstStringArray));
System.out.println("-----------------------------------------------");
int i = dClass.searchArray(dClass.firstIntArray,25);
if(i==-1){
System.out.println(25 +" Not Found in an array "+Arrays.toString(dClass.firstIntArray));
} else{
System.out.println(25 +"is at Index of "+i+" in an array "+Arrays.toString(dClass.firstIntArray));
}
int j = dClass.searchArray(dClass.firstDoubleArray,9.6);
if(j==-1){
System.out.println(9.6+" Not Found in an array "+Arrays.toString(dClass.firstDoubleArray));
} else{
System.out.println(9.6 +" is at Index of "+j+" in an array "+Arrays.toString(dClass.firstDoubleArray));
}
int k = dClass.searchArray(dClass.firstStringArray,"1.2");
if(k==-1){
System.out.println(1.2 +" Not Found in an array "+Arrays.toString(dClass.firstStringArray));
} else{
System.out.println(25 +" is at Index of "+k+" in an array "+Arrays.toString(dClass.firstStringArray));
}
}
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.