i need the answer quickly Part I:Question 1: Write a complete Java program - with your own code writing - thatcontains:1. A main method2. Another method that returns a value3. An array in the main method4. A loop: for, while, or do-while5. A selection: if-else or switchQuestion 2: Test your program. Ensure that it runs correctly (syntax error free).Part II:Question 1:Write the program of Part 1 in 2 other programming languages from the list shownbelow.1. Pascal2. Ada3. Ruby4. Perl5. Python6. C-sharp7. Visual Basic8. FortranQuestion 2:Map each code line in the new 2 programming languages that you have written to itscorresponding code line in the primary Java program.

As per the requirement I am providing the code for Part I (Question 1 and Question 2). Note: As per…

Part I: Question 1: Write a complete Java program - with your own code writing - that contains: 1. A main method 2. Another method that returns a value 3. An array in the main method 4. A loop: for, while, or do-while 5. A selection: if-else or switch Question 2: Test your program. Ensure that it runs correctly (syntax error free).

Part I: Question 1: Write a complete Java program - with your own code writing - that contains: 1. A main method 2. Another method that returns a value 3. An array in the main method 4. A loop: for, while, or do-while 5. A selection: if-else or switch Question 2: Test your program. Ensure that it runs correctly (syntax error free).

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

Please complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Using quicksort to sort an array of car objects by various criteria. Define a class Car as follows: class Car { public String make; public String model; public int mpg; // Miles per gallon } a) Implement a comparator called CompareCarsByMakeThenModel that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByMakeThenModel should return a value that will cause quicksort to sort an array of cars in ascending order (from smallest to largest) by make and, when two cars have the same make, in ascending order by model. b) Implement a comparator called CompareCarsByDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByDescendingMPG should return a value that will cause quicksort to sort an array of cars in descending order (from largest to smallest) by mpg. c) Implement a comparator called…
Please complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Only finish the (d) question, Thank you ! Using quicksort to sort an array of car objects by various criteria. Define a class Car as follows: class Car { public String make; public String model; public int mpg; // Miles per gallon } a) Implement a comparator called CompareCarsByMakeThenModel that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByMakeThenModel should return a value that will cause quicksort to sort an array of cars in ascending order (from smallest to largest) by make and, when two cars have the same make, in ascending order by model. b) Implement a comparator called CompareCarsByDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByDescendingMPG should return a value that will cause quicksort to sort an array of cars in descending order (from largest to smallest) by mpg. c)…
FOR JAVA Write a Java class named Book, which has a name, an author and a pub- lisher. This class must also have a static field (an array with length 100) which holds names of all constructed books, and a static method which returns the number of constructed books.
Answer the given question with a proper explanation and step-by-step solution. Can someone tell me why I'm getting Java error cannot invoke add(int) on array type int on the bold line? I need this method to calculate median based on file that will be input in a different method. Do no change to a main method as I need to reserve that to only have a contructor. public int Problem7(File file) throws FileNotFoundException { int[] listInt; try { Scanner scanner = new Scanner(file); while (scanner.hasNextLine()) { String value = scanner.nextLine(); listInt.add(Integer.parseInt(value)); System.out.println(value); } scanner.close(); } catch (Exception ex) { ex.printStackTrace(); } Arrays.sort(listInt); int middle = listInt.length/2; int median = 0; if (listInt.length%2 == 1) median = listInt[middle]; else median = (listInt[middle-1] + listInt[middle]) / 2; return median; }}
In Java: Ask the user to enter the size of an array. It must be greater than 0. Write a method, inputValidation, that returns the size of the array to the main.
java In this task, you need to write 2 overloaded methods findMax() that will find a maximum number in the array. First version should work with array of integers (int[]) and return int, and second method should work with an array of doubles (double[]) and return double as a result. Methods must have the same name and different parameters.
WRITE THE BODY OF Java program - THE checkWinner METHOD BELOW SO THAT THE GAME STOPS WHEN SOMEONE WINS, OR WHEN THE BOARD IS FULL. AS SHOWN IN THE SAMPLE OUTPUT AT THE BOTTOM. Code: import java.util.Scanner; public class TicTacBoard { private char[][] board; // 2-D array of characters private char curPlayer; // the player whose turn it is (X or O) // Constructor: board will be size x size public TicTacBoard(int size) { board = new char[size][size]; // initialize the board with all spaces: for(int row=0; row < board.length; row++) for(int col=0; col < board[row].length; col++) board[row][col] = ' '; curPlayer = 'X'; // X gets the first move } public void playGame() { display(); do { takeTurn(); display(); }while(!checkWinner()); } /////// display //////// // Display the current status of the board on the // screen, using hyphens (-) for horizontal lines // and pipes (|) for vertical lines. public void…
Consider the method headings: void funcOne(int [ ] alpha, int size) int funcSum(int x, int y) void funcTwo(int [ ] alpha, int [ ] beta) and the declarations: int [ ] list = new int [50]; int [ ] Alist = new int [60]; int num; Write Java statements that do the following: a. Call the method funcOne with the actual parameters, the array list and 50, respectively. b. Print the value returned by the method funcSum with the actual parameters, the thirtieth and tenth components of list, respectively. c. Call the method funcTwo with the actual parameters, the array list and array Alist, respectively.
Solve below java problem please. You are given a list of Employee objects and you need to implement a method that returns the top n highest-paid employees. class Employee { private String name; private double salary; public Employee(String name, double salary) { this.name = name; this.salary = salary; } public String getName() { return name; } public double getSalary() { return salary; } }
Please complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Using quicksort to sort an array of car objects by various criteria. Define a class Car as follows: class Car { public String make; public String model; public int mpg; // Miles per gallon } b) Implement a comparator called CompareCarsByDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByDescendingMPG should return a value that will cause quicksort to sort an array of cars in descending order (from largest to smallest) by mpg.
Please complete the task by yourself only in JAVA with explanation. Don't copy. Thank you. Using quicksort to sort an array of car objects by various criteria. Define a class Car as follows: class Car { public String make; public String model; public int mpg; // Miles per gallon } c) Implement a comparator called CompareCarsByMakeThenDescendingMPG that can be passed as an argument to the quicksort method from the lecture notes. CompareCarsByMakeThenDescendingMPG should return a value that will cause quicksort to sort an array of cars in ascending order by make and, when two cars have the same make, in descending order by mpg.
Please help me with this , I am stuck ! PLEASE WRITE IT IN C++ Thanks 1) bagUnion: The union of two bags is a new bag containing the combined contents of the original two bags. Design and specify a method union for the ArrayBag that returns as a new bag the union of the bag receiving the call to the method and the bag that is the method's parameter. The method signature (which should appear in the .h file and be implemented in the .cpp file is: ArrayBag<T> bagUnion(const ArrayBag<T> &otherBag) const; This method would be called in main() with: ArrayBag<int> bag1u2 = bag1.bagUnion(bag2); Note that the union of two bags might contain duplicate items. For example, if object x occurs five times in one bag and twice in another, the union of these bags contains x seven times. The union does not affect the contents of the original bags. Here is the main file: #include <cstdlib>#include <iostream>#include "ArrayBag.h"using namespace std; template…