4.20 LAB Zip code and population (generic types) JAVADefine a cla.pdf

•

0 gefällt mir•77 views

4.20 LAB: Zip code and population (generic types) JAVA Define a class StatePair with two generic types (Type1 and Type2), a constructor, mutators, accessors, and a printInfo() method. Three ArrayLists have been pre-filled with StatePair data in main(): ArrayList> zipCodeState: Contains ZIP code/state abbreviation pairs ArrayList> abbrevState: Contains state abbreviation/state name pairs ArrayList> statePopulation: Contains state name/population pairs Complete main() to use an input ZIP code to retrieve the correct state abbreviation from the ArrayList zipCodeState. Then use the state abbreviation to retrieve the state name from the ArrayList abbrevState. Lastly, use the state name to retrieve the correct state name/population pair from the ArrayList statePopulation and output the pair. Ex: If the input is: the output is: WHATS ALREADY GIVEN: StatePopulations.java import java.util.Scanner; import java.io.FileInputStream; import java.io.IOException; import java.util.ArrayList; public class StatePopulations { public static ArrayList> fillArray1(ArrayList> statePairs, Scanner inFS) { StatePair pair; int intValue; String stringValue; while (inFS.hasNextLine()) { intValue = inFS.nextInt(); stringValue = inFS.next(); pair = new StatePair (intValue, stringValue); statePairs.add(pair); } return statePairs; } public static ArrayList> fillArray2(ArrayList> statePairs, Scanner inFS) { StatePair pair; String stringValue1; String stringValue2; while (inFS.hasNextLine()) { stringValue1 = inFS.next(); inFS.nextLine(); stringValue2 = inFS.nextLine(); pair = new StatePair (stringValue1, stringValue2); statePairs.add(pair); } return statePairs; } public static ArrayList> fillArray3(ArrayList> statePairs, Scanner inFS) { StatePair pair; String stringValue; int intValue; while (inFS.hasNextLine()) { stringValue = inFS.nextLine(); intValue = inFS.nextInt(); inFS.nextLine(); pair = new StatePair (stringValue, intValue); statePairs.add(pair); } return statePairs; } public static void main(String[] args) throws IOException { Scanner scnr = new Scanner(System.in); FileInputStream fileByteStream = null; // File input stream Scanner inFS = null; // Scanner object int myZipCode; int i; // ZIP code - state abbrev. pairs ArrayList> zipCodeState = new ArrayList>(); // state abbrev. - state name pairs ArrayList> abbrevState = new ArrayList>(); // state name - population pairs ArrayList> statePopulation = new ArrayList>(); // Fill the three ArrayLists // Try to open zip_code_state.txt file fileByteStream = new FileInputStream("zip_code_state.txt"); inFS = new Scanner(fileByteStream); zipCodeState = fillArray1(zipCodeState, inFS); fileByteStream.close(); // close() may throw IOException if fails // Try to open abbreviation_state.txt file fileByteStream = new FileInputStream("abbreviation_state.txt"); inFS = new Scanner(fileByteStream); abbrevState = fillArray2(abbrevState, inFS); fileByteStream.close(); // Try to open state_population.txt file fileByteStream = new FileInputStr.

Bildung

public static ArrayList> fillArray2(ArrayList> statePairs,
Scanner inFS) {
StatePair pair;
String stringValue1;
String stringValue2;
while (inFS.hasNextLine()) {
stringValue1 = inFS.next();
inFS.nextLine();
stringValue2 = inFS.nextLine();
pair = new StatePair (stringValue1, stringValue2);
statePairs.add(pair);
}
return statePairs;
}
public static ArrayList> fillArray3(ArrayList> statePairs,
Scanner inFS) {
StatePair pair;
String stringValue;
int intValue;
while (inFS.hasNextLine()) {
stringValue = inFS.nextLine();
intValue = inFS.nextInt();
inFS.nextLine();
pair = new StatePair (stringValue, intValue);
statePairs.add(pair);
}
return statePairs;
}
public static void main(String[] args) throws IOException {
Scanner scnr = new Scanner(System.in);
FileInputStream fileByteStream = null; // File input stream
Scanner inFS = null; // Scanner object
int myZipCode;

$int i; // ZIP code - state abbrev. pairs ArrayList> zipCodeState = new ArrayList>(); // state abbrev. - state name pairs ArrayList> abbrevState = new ArrayList>(); // state name - population pairs ArrayList> statePopulation = new ArrayList>(); // Fill the three ArrayLists // Try to open zip_code_state.txt file fileByteStream = new FileInputStream("zip_code_state.txt"); inFS = new Scanner(fileByteStream); zipCodeState = fillArray1(zipCodeState, inFS); fileByteStream.close(); // close() may throw IOException if fails // Try to open abbreviation_state.txt file fileByteStream = new FileInputStream("abbreviation_state.txt"); inFS = new Scanner(fileByteStream); abbrevState = fillArray2(abbrevState, inFS); fileByteStream.close(); // Try to open state_population.txt file fileByteStream = new FileInputStream("state_population.txt"); inFS = new Scanner(fileByteStream); statePopulation = fillArray3(statePopulation, inFS); fileByteStream.close(); // Read in ZIP code from user myZipCode = scnr.nextInt(); for (i = 0; i < zipCodeState.size(); ++i) { // TODO: Using ZIP code, find state abbreviation$

}
for (i = 0; i < abbrevState.size(); ++i) {
// TODO: Using state abbreviation, find state name
}
for (i = 0; i < statePopulation.size(); ++i) {
// TODO: Using state name, find population. Print pair info.
}
}
}
StatePair.java
public class StatePair , Type2 extends Comparable> {
private Type1 value1;
private Type2 value2;
// TODO: Define a constructor, mutators, and accessors
// for StatePair
// TODO: Define printInfo() method
}

Weitere ähnliche Inhalte

Ähnlich wie 4.20 LAB Zip code and population (generic types) JAVADefine a cla.pdf

Java 8 Examples

Scott Taylor

BasicPizza.java public class BasicPizza { //Declaring instance variables String type; String crust; String ingredients; double cost; //Default Constructor public BasicPizza() { super(); } //Parameterized constructor public BasicPizza(String type) { super(); this.type = type; } //Setters and Getters public String getType() { return type; } public void setType(String type) { this.type = type; } public String getCrust() { return crust; } public void setCrust(String crust) { this.crust = crust; } public String getIngredients() { return ingredients; } public void setIngredients(String ingredients) { this.ingredients = ingredients; } public double getCost() { return cost; } public void setCost() { this.cost = 5; } //toString() method is used to display the contents of the Object.inside it. @Override public String toString() { return \"BasicPizza [type=\" + type + \", crust=\" + crust + \", ingredients=\" + ingredients + \", cost=\" + cost + \"]\"; } } ________________________________________________________________ LiFiCheese.java public class LiFiCheese extends BasicPizza{ //Declaring instance variables private String crust; private double cost; private String ingredients; //Default constructor public LiFiCheese() { super(\"Cheese\"); this.cost=5; } //Setters and getters public void setCrust() { this.crust=\"thin\"; } public String getCrust() { return crust; } public double getCost() { return cost; } public void setCost(double cost) { } public String getIngredients() { return ingredients; } public void setIngredients(String ingredients) { this.ingredients = ingredients; } //toString() method is used to display the contents of the Object.inside it. @Override public String toString() { System.out.println(\"You Ordered :\"); System.out.println(getType()); setCrust(); System.out.println(getCrust()); System.out.println(\"Total Cost of :\"+getCost()); return \"\"; } } __________________________________________________________________________ LiFiPizza.java import java.util.Scanner; public class LiFiPizza extends BasicPizza { //Declaring instance variables private String type; private double cost; private String crust; private String ingredients; //Default constructor public LiFiPizza() { super(); this.type = \"Meat\"; this.cost=5; } //Setters and getters public String getType() { return type; } public void setType(String type) { this.type = type; } public double getCost() { return cost; } public void setCost() { this.cost = this.cost+2; } public String getCrust() { return crust; } public void setCrust(String crust) { if(crust.equals(\"Thin\")) { this.crust=\"Thin\"; } else if(crust.equals(\"Thick\")) { this.crust=\"Thick\"; } } public String getIngredients() { return ingredients; } public void setIngredients(String ingredients) { this.ingredients = ingredients; } //toString() method is used to display the contents of the Object.inside it. @Override public String toString() { System.out.println(\"You Ordered :\"); System.out.println(getType()); System.ou.

BasicPizza.javapublic class BasicPizza { Declaring instance .pdf

ankitmobileshop235

Introduction to objects and inputoutput

Ahmad Idrees

JAVA help Need bolded lines fixed for it to compile. Thank you! public class PersonSort { // Test file. Format is \"STRING int int int\" static final String PERSON_FILE = \".\\\\src\\\\Persons.txt\"; public static void main(String[] args) throws FileNotFoundException { // Create new ArrayList and populate from test file ArrayList list1 = new ArrayList(); populate(list1); // Create new array with same people ArrayList list2 = new ArrayList(list1); insertionSort(list1); // Print result of sort System.out.println(\"INSERTION SORT\"); // *** foreach Person p in list1 { System.out.println(p.toString()); } selectionSort(list2); System.out.println(); System.out.println(\"SELECTION SORT\"); // *** foreach Person p in list2 { System.out.println(p.toString()); } } /* * populate - this method reads the Persons.txt file and creates an array list * */ public static ArrayList populate(ArrayList list) throws IOException { // Scan in the file File people = new File(PERSON_FILE); Scanner ppl = new Scanner(people); // While we have a next line, create a new Person and add it to the list while (ppl.hasNextLine()) { String name = ppl.next(); int month = ppl.nextInt(); int day = ppl.nextInt(); int year = ppl.nextInt(); list.add(new Person(name, month, day, year)); } ppl.close(); return list; } /** * * Sorts an ArrayList based on the insertion sort algorithm. Modified code based * on insertion sort from Sort.java in Lesson3SourceCode. * */ // *** change double[] to ArrayList public static void insertionSort (double[] list) { // Temporary variable for the next item to be inserted // *** change double to Person double valueToInsert; int insertPos = 0; // Iterate through the array taking each array element in turn // as the next one to be inserted in its correct position. // This element is placed in its correct position in the array of // previously sorted elements contained in the lower array indices. for (int i = 1; i < list.size(); i++) { // Hold the next element to be inserted, // until we find the correct spot valueToInsert = list.get(i); insertPos = i; // Find the correct place to insert this element // in the lower array indices of already sorted elements while ((insertPos > 0) && (list.get(insertPos - 1).compareTo(valueToInsert) > 0)) { // Move elements up the array // and insert position down list.set(insertPos, list.get(insertPos - 1)); insertPos--; } // We are at the correct position, so insert the element list.set(insertPos, valueToInsert); } } /** * * Sorts an ArrayList based on the selection sort algorithm. Modified code based * on selection sort from Sort.java in Lesson3SourceCode. * */ // *** change double[] to ArrayList public static void selectionSort (double[] list) { for (int i = 0; i < list.size(); i++) { // Find the minimum in the ArrayList through [i..list.length-1] // *** change double to Person double currentMin = list[i]; int currentMinIndex = i; for (int j = i + 1; j < myList.size(); j++) { if (currentMin.compareTo(list.get(j)) > 0) { curr.

JAVA helpNeed bolded lines fixed for it to compile. Thank you!pu.pdf

suresh640714

Use the graph of the function f below to find the following. All local minimum values of f All values at which f has a local minimum If there is more than one answer, separate them with commas. All local minimum values of f All values at which f has a local minimum: Solution Dear student Thank you for using Chegg As per the given curve it is clear that the local minimum values of f are -3 & 0 Values of x when curve attain minimum values are x = -2,3.

Using Array Approach, Linked List approach, and Delete Byte Approach.pdf

fms12345

I need help with this program for java. The program you are given to start with: Lab4.java The input file of ints:10,000ints.txt The input file of words:172,822words.txt Execute your program like this: C:\\> java Lab4 10000ints.txt 172822words.txt Be sure to put the ints filename before the words filename. The starter file will be expecting them in that order. Lab#4\'s main method is completely written. Do not modify main. Just fill in the methods. Main will load a large arrays of int, and then load a large array of Strings. As usual the read loops for each file will be calling a resize method as needed. Once the arrays are loaded, each array will be tested for the presence of duplicates via calls to indexOfFirstDuplicate(). Do not do any trim operation. Here are the rules: In your methods that look for the first occurrence of a duplicate in each array, you must sort the arrays before looking for the dupe. Do not search the array for the dupe until it is sorted. We require this because an unsorted array would require a quadratic algorithm (N squared via nested loops). If you sort you array first you will only incur an O(n*Log2n) cost for the sort with an additional O(n) for the search. This is the best that can be done without using a technology such as hashing which you will use for your next lab. Inside your method to find the dupe you must sort the array first. Do not define/use any new type or data structure that we have not covered yet. Your traversal of the array looking for the dupe should require no more than one pass. Be as efficient as you can without breaking rule #2. Assuming the array below, the 1st occurrence of a duplicate is at index 4, not 3, since the element at [4] is the first index position where that value was seen for a second time. Be sure you understand this. Do not report the index of the first occurrence of a value as being the index where the duplicate occurred. Your job will be to fill in the definitions of these methods below main static int[] upSizeArr( int[] fullArray ); // incoming array is FULL. It needs it\'s capacity doubled static String[] upSizeArr( String[] fullArray ); // incoming array is FULL. It needs it\'s capacity doubled static int indexOfFirstDupe( int[] arr, int count ); // returns ind of 1st occurrence of duplicate value static int indexOfFirstDupe( String[] arr, int count ); // returns ind of 1st occurrence of duplicate value Here is the starting file! Solution HI, Please find my implementation of all required methods. Please let me know in case of any issue. /* Lab4.java Reads two files into two arrays then checks both arrays for dupes */ import java.io.*; import java.util.*; public class Lab4 { static final int INITIAL_CAPACITY = 10; static final int NOT_FOUND = -1; // indexOfFirstDupe returns this value if no dupes found public static void main (String[] args) throws Exception { // ALWAYS TEST FIRST TO VERIFY USER PUT REQUIRED INPUT FILE NAME ON THE COMMAND LINE if (args.length < 1 ) { Syst.

I need help with this program for java.The program you are given t.pdf

fonecomp

In Java- Create a Graduate class derived from Student- A graduate has.pdf

Stewart29UReesa

Complete the following Java code such that it opens a file named FruitList.txt, reads the first line from the file, and then prints the first line on console screen. Your Java code should handle possible exception(s). Assume that the file contains the name of a fruit in each line. You don\'t need to provide comments. // complete import statement(s) here public class FileRead { public static void main(String[] args) { // complete the code here } } Solution import java.io.File; import java.util.Scanner; /** * @author * */ public class FileRead { /** * @param args */ public static void main(String[] args) { // complete the code here Scanner scanner = null; try { File file = new File(\"FruitList.txt\"); scanner = new Scanner(file); // checks the file contains data if (scanner.hasNext()) { // prints first line System.out.println(scanner.nextLine()); } } catch (Exception e) { // TODO: handle exception } } } FruitList.txt Apple Orange Papaya Banana Jack Fruit Watermelon KIWI Grapes Mango Pineapple OUTPUT: Apple .

Complete the following Java code such that it opens a file named Fruit.docx

ljohn878

Introduction NullPointerException is a RuntimeException . In Java, a special null value can be assigned to an object reference. NullPointerException is thrown when an application attempts to use an object reference that has the null value. These include: Calling an instance method on the object referred by a null reference. IndexOutOfBoundsException is a subclass of RuntimeException mean it is an unchecked exception which is thrown to indicate that an index of some sort (such as to an array, to a string, or to a vector) is out of range.e.g using List. FileNotFoundException extends IOException. Signals that an attempt to open the file denoted by a specified pathname has failed. This exception will be thrown by the FileInputStream , FileOutputStream , and RandomAccessFile constructors when a file with the specified pathname does not exist. ArrayIndexOutOfBoundsException thrown to indicate that an array has been accessed with an illegal index. The index is either negative or greater than or equal to the size of the array. IllegalArgumentException - when a method is passed an argument which is "illegal" or doesn't work with the method NoSuchMethodException - When a method is attempted to be used but it does not exist ArithmeticException is an unchecked exception in Java. Usually, one would come across java. lang. ArithmeticException: / by zero which occurs when an attempt is made to divide two numbers and the number in the denominator is zero. ***IN JAVA PLEASE HELP*** import java.util.Scanner; public class SecureCoding { public static void main(String[] args) { String myString; String mySecondString = "hello world"; Int arrayFileSize = 10; myString.equals(mySecondString); //What is wrong in previous three lines of code? How to solve it with exception handling? Write the corrected code segment(10 pts) char charAtLengthIndex = mySecondString.charAt(11); // what is wrong in previous line of code? what exception handling can solve it? Write the corrected code (10 pts) Scanner input = new Scanner(System.in); int[] myArray = new int[6]; int[] fileArray = new int[10]; fillArray(input, myArray); printArray(myArray); int[] fileArray = new int[arrayFileSize]; // ToDo: Write a code segment which will get data from a file to the array fileArray. Create/use your own file for this purpose. What if the file is not found? What exception handling solves this? Rewrite the code segment(20 pts) // What if a file element is not found? Write the code segment (10 pts) } public static void fillArray(Scanner s, int[] a) { System.out.print("Enter " + a.length + " integers: "); // Implement a solution when your array is accessed out of its length (10 pts) // Find a way in the loop segment where the Array size is not fixed/hard coded(10 pts) // Implement a solution when a method is not found from the caller (main) method (10 pts) // is there any arithmatic exception. what to do? (10 pts) // Explain about two more exception handling in Java that you have not implemented in .

Introduction NullPointerException is a RuntimeException In.pdf

adinathknit

cant figure out how to add $20 to variables if it equals one of the three: pit, rott, or dob also need total of all totals tried using \"for\" loop but its not coming out right here is what i have so far import java.io.File; // Importing respective packages import java.io.FileNotFoundException; import java.util.Scanner; class file{public static void main(String[] args) throws FileNotFoundException { // Primitive variables for holding values for calulation. int weight = 0; int numdays = 0 ; double tax = 0.06; double fee = 0.70; double taxtotal = 0; double subtotal = 0; double total= 0; String title = \"Madison Kennel & Grooming\"; // String Object for title String first_name,last_name,breed; String pit = \"Pit bull\"; String dob = \"Doberman\"; String rott = \"Rottweiler\"; File board = new File(\"C:///boarding.txt\"); Scanner inputFile = new Scanner(board); while (inputFile.hasNext()) { first_name = inputFile.nextLine(); last_name = inputFile.nextLine(); breed = inputFile.nextLine(); weight = inputFile.nextInt(); numdays = inputFile.nextInt(); inputFile.nextLine(); inputFile.hasNext(); System.out.println(first_name); System.out.println(last_name); System.out.println(breed); System.out.println(weight); System.out.println(numdays); if (breed == pit || breed == dob || breed == rott) { subtotal = subtotal + 20; } if (inputFile.hasNextLine()) { inputFile.nextLine(); } // Calculations for totals // Display output of totals subtotal = fee * weight * numdays; taxtotal = subtotal * tax; total = subtotal + taxtotal; System.out.println(\"\ \ \" + title + \"\ \" + \"-------------------------\" + \"\ \ \" + \"Weight: \" + weight + \"\ \" + \"Boarding days: \" + numdays + \"\ \" + \"Total boarding fee for \" + numdays + \" days (before taxes): $ \" + subtotal + \"\ \" + \"Total amount of tax (6% tax rate): $ \" + taxtotal + \"\ \" + \"Total boarding fee with tax: $ \" + total + \"\ \"); double billtotal = 0; for (int count = 0; count > total; count++) { billtotal = count; } System.out.println(billtotal); } } } Solution Hi, You mispaced if loop . please find below corrected code import java.io.File; // Importing respective packages import java.io.FileNotFoundException; import java.util.Scanner; class file { public static void main(String[] args) throws FileNotFoundException { // Primitive variables for holding values for calulation. int weight = 0; int numdays = 0 ; double tax = 0.06; double fee = 0.70; double taxtotal = 0; double subtotal = 0; double total= 0; String title = \"Madison Kennel & Grooming\"; // String Object for title String first_name,last_name,breed; String pit = \"Pit bull\"; String dob = \"Doberman\"; String rott = \"Rottweiler\"; File board = new File(\"C:///boarding.txt\"); Scanner inputFile = new Scanner(board); while (inputFile.hasNext()) { first_name = inputFile.nextLine(); last_name = inputFile.nextLine(); breed = inputFile.nextLine(); weight = inputFile.nextInt(); numdays = inputFile.nextInt(); inputFile.nextLine(); inputFile.hasNe.

cant figure out how to add $20 to variables if it equals one of the .pdf

xlynettalampleyxc

Creat Shape classes from scratch DETAILS You will create 3 shape classes (Circle, Rectangle, Triangle) that all inherit from a single abstract class called AbstractShape which implements Shape (also created by you). You are also responsible for creating the driver class \"Assignment7.java\" (program that tests your classes and described on page 3) which does the following reads input data from a file instantiates various objects of the three shapes based on the input data stores each in a LinkedList outputs this list to an output file sorts a \"copy\" of this LinkedList of objects outputs the sorted version of the list to the output file outputs the original list to the output file This driver program also needs to \"ignore errors in the input file that breach the specified input format as described in the Assianment7,java details (see page 3 1. Shape.java This is an interface that has 2 abstract methods, and passes the responsibility of implementing the compareTo method to the class that implements Shape (you may note, nomally Comparable is \"implemented\" by a class. However, an interface cannot implement because interfaces can only contain abstract methods. That said, an interface can only extend other interfaces and the responsibility of actually \"implementing\" the abstract method(s) of the super class interface is passed on to the sub-classes) public interface Shape extends Comparable public double calculateAreal) Il This abstract method is implemented at the concrete level public Shape copyShape); Il also implemented at the concrete level 2. AbstractShape.java public abstract class AbstractShape implements Shape This class should contain an instance field to store the name of each obiect. The constructor which sets this field should receive the name and a number to be concatenated to the name and then stored in the name field Recall, when the super class has a parameterized constructor, the sub-classes will need to call it AND the sub- classes will need to also provide a constructor without parameters This abstract class will implement the compareTo method passed on from the Shape interface and will pass on the responsibility of implementing calculateArea to the extending sub-classes (compare To will use the calculateArea method when comparing 2 Shape objects). Along with compare To, one more concrete method should be included. The following will be used by the sub-classes\' toString method: public String getName) II Simply returns the name field data Solution in7.txt 4.4 2.5 3 8.1 3.0 5.0 2.5 3 4 2.5 tuesday -7 1.0 3 three 3 -9 3 5 1.0 Assignment7.java import java.io.*; import java.util.*; public class Assignment7 { /** * This is the test driver class that will include main. * This program MUST read a file named in7.txt and * generate an output file named out7.txt. The in7.txt * file must be created by you based on formatting * described shortly. * * @param theArgs */ public static void main(String[] theArgs) { List myList = new Arra.

Creat Shape classes from scratch DETAILS You will create 3 shape cla.pdf

aromanets

Sorting Questions (JAVA) See attached classes below. Attached Classes ------------------------------------------- Patient.java package A9.toStudents; public class Patient implements Comparable{ //attributes private int order; private String name; private boolean emergencyCase; //constructor public Patient(int order, String name, boolean emergencyCase) { this.order = order; this.name = name; this.emergencyCase = emergencyCase; } //compareTo public int compareTo(Patient other) { if(this.isEmergencyCase() && !other.isEmergencyCase()) return -1; //place this first else if(!this.isEmergencyCase() && other.isEmergencyCase()) return 1; //place other first else //if both are emergency or both are not emergency return this.getOrder()-other.getOrder(); //place smaller order first } //getters and setters public int getOrder() { return order; } public void setOrder(int order) { this.order = order; } public String getName() { return name; } public void setName(String name) { this.name = name; } public boolean isEmergencyCase() { return emergencyCase; } public void setEmergencyCase(boolean emergencyCase) { this.emergencyCase = emergencyCase; } public String toString() { return (isEmergencyCase()?\"*\":\"\") + name; } } -------------------------------------------------------- PatientComparator.java package A9.toStudents; import java.util.Comparator; public class PatientComparator implements Comparator{ public int compare(Patient p1, Patient p2) { if(p1.isEmergencyCase() && !p2.isEmergencyCase()) return -1; //place p1 first else if(!p1.isEmergencyCase() && p2.isEmergencyCase()) return 1; //place p2 first else //if both are emergency or both are not emergency return p1.getOrder()-p2.getOrder(); //place smaller order first } } --------------------------------- PatientTestQ12.java package A9.toStudents; import java.util.ArrayList; public class PatientTestQ12 { public static void main(String[] args) { ArrayList list = new ArrayList<>(5); list.add(new Patient(1, \"p1\", false)); list.add(new Patient(2, \"p2\", false)); list.add(new Patient(3, \"p3\", true)); list.add(new Patient(4, \"p4\", false)); list.add(new Patient(5, \"p5\", true)); //before sorting System.out.printf(\"%-15s%25s\ \", \"Before sorting\", list); //should be [p1, p2, p3, p4, p5] //try bubble sort methods for Q1 //Sorter.bubbleSort(list); //Sorter.bubbleSort(list, new PatientComparator()); //other sort methods for Q2 //Sorter.selectionSort(list); //Sorter.insertionSort(list); //after sorting System.out.printf(\"%-15s%25s\ \", \"After sorting\", list); //should be [p3, p5, p1, p2, p4] } } In this assignment, you will build a class that can be used to sort a list of patient using different algorithms, and you will also compare the time efficiency of these algorithms Download the following files from Connect to help you work on this assignment: Patient.java PatientComparator.java PatientTestQ12.java Q1. Create a class called Sorter that has two static methods: (10 marks) public static void bubbleSo.

Sorting Questions (JAVA)See attached classes below.Attached Clas.pdf

akritigallery

Java stream

Arati Gadgil

Adapt your code from Assignment 2 to use both a Java API ArrayList and a Java API LinkedList and your new I_a (fish) objects from Assignment 3. The new program should have a main user menu like in A2 with an added choice to print the list backwards. There should be a new makeFish static method and a printing method similar to that in A2 renamed to printForwards and one new method printBackwards. Making Fish When making an I_a object in the makeFish method, instead of asking the user to enter all the information as you did for Pokemon in A2, make a sub-menu for them to pick from the 14 kinds of I_a implemented in A3 The only thing the user must choose is the I_a type and if they want to enter the length (or get a random length) You should ask, Do you want to enter a length for your I'a, Y/N HINT: use equalsIgnoreCase to simplify user input If they choose to enter the length then you will need to ask for the length and convert the input to a double for the constructor. You will need to try/catch for non-number and FishSizeException. This will need to loop until you get a valid length. Finally use a switch to call the constructor for the chosen I_a. For example: case 1: I_a ia = new Pua_ama(); or case 7: I_a ia = new PalaMoi(14.25); or case 9:I_a ia = new Ohua(3.3)); Lists of Fish The program should have both a Java API ArrayList and LinkedList. You must correctly declare both generic types to hold I_a objects. They should be local to the main method (like the array in A2). Use the List interface to declare both list variables, then initialize as the two different kinds of lists: List List1 = new ArrayList<>(); List List2 = new LinkedList<>(); Add each I_a the user makes to both lists. To add the first six I_a you can use the List Interface add method: List.add(E element) This will add to the end (higher index) of both kinds of lists. The allowed number of stored I_a should be limited to 6 like in the array in A2. Don't let either List keep growing even though they can! The lists should work the same as in A2, the 7th I_a should "wrap around" and overwrite the first I_a made (in index 0), and so on. To overwrite existing elements using the List.set(int index, E element) method. Printing Lists The printArray method from A2 should be renamed to printForwards, it should still be void, and should take one parameter of type List instead of an array. The new printBackwards method will be nearly identical, but will print a List in reverse index order: 5 4 3 2 1 0 Both methods must use ListIterators to print the List contents. The printForwards method should get the ArrayList sent to it from the menu choice to print the list and should print out just like the old array did, forwards. The printBackwards method should have the LinkedList sent to it from the menu choice to print the list backwards and should print out in REVERSE order. HERE IS I.a java code: import java.util.Random; public abstract class I_a { protected final String name; protected final S.

Adapt your code from Assignment 2 to use both a Java API ArrayList a.pdf

albarefqc

project2/.classpath project2/.project project2 linklist org.eclipse.jdt.core.javabuilder org.eclipse.jdt.core.javanature project2/bin/project2/emplist.classpackage project2; publicsynchronizedclass emplist { public void emplist(); publicstatic void main(String[]) throws java.io.IOException; } project2/bin/project2/method1.classpackage project2; publicsynchronizedclass method1 { java.util.LinkedList newList; public void method1(); void reverse(java.util.LinkedList); void downsize(java.util.LinkedList, int); } project2/employees.txt Ahmed Bill Diana Harry Juliet Nina Romeo Sam Tom Zack project2/src/project2/emplist.javaproject2/src/project2/emplist.javapackage project2; import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException; import java.util.LinkedList; import java.util.ListIterator; publicclass emplist { publicstaticvoid main(String[] args)throwsIOException{ // TODO Auto-generated method stub LinkedList<String> linkedlist =newLinkedList<String>(); method1 obj =new method1(); System.out.println("\t\t\t********************************************************"); System.out.println("\t\t\t********* This Program was written by ziyad **********"); System.out.println("\t\t\t********************************************************"); try(BufferedReader br =newBufferedReader(newFileReader( "employees.txt"))){ String sCurrentLine; while((sCurrentLine = br.readLine())!=null){ // System.out.println(sCurrentLine); linkedlist.add(sCurrentLine); // System.out.println(linkedlist); } String firstElement = linkedlist.get(0); String lastElement = linkedlist.getLast(); System.out.println("\tDisplaying List contentusing traditional for loop"); for(int i =0; i < linkedlist.size(); i++){ System.out.println("Name of Emp is "+ linkedlist.get(i)); } System.out.println("The first element of the List: "+ firstElement); System.out.println("The last element of the List: "+ lastElement); System.out.println("The size of the list after removing the last element Zack is: 9"); System.out.println("\tDisplaying using by using enhances for loop: "); for(int a =0; a < linkedlist.size(); a++){ System.out.println(linkedlist.get(a)); } ListIterator iter = linkedlist.listIterator(); while(iter.hasNext()){ int i = iter.nextIndex(); iter.next(); // System.out.println(iter.next() + " is at index" + i); if(i ==0){ System.out.println("The current emplyee after advancing the iter five timers is: " + iter.previous()); Object element = iter.next(); iter.add("kelly"); // iter.set( "Kelly"); int k =0; // while( k < linkedlist.size()) { System.out.println("\tDisplaying list after inserting Kelly after the fifth position\n"+ linkedlist +" "); k++; } }elseif(i ==6){ System.out.println("\tDisplaying list after setting the current element to Nancy"+ iter.previous()); Object element1 = iter.next(); .

project2.classpathproject2.project project2 .docx

briancrawford30935

Write a program that will test a name) method no sorting routine from.docx

ajoy21

File Handling in Java.pdf

SudhanshiBakre1

Use the following data set that compares age to average "years left to live" to answer the following questions. Age 10 20 30 40 50 60 70 80 90 100 Years to live 59.2 49.6 40.7 31.9 24.0 17.2 11.6 7.2 4 .4 2.8 a) Show the scatterplot for this data with the least squares regression line. Find R^2. How much of the variation is explained by the regression line? b) Experiment with the non-linear regressions available on the calculator. Which seem to fit? Show the scatterplot with three different regression curves from the calculator. Label each equation, as well as the applicable R^2. c) Choose a regression equation to predict how many "years left" a person has if he is now 101 years old. Can he count on celebrating Christmas 2015? InfoTest.javaInfoTest.javapackage assignment1; importstatic org.junit.Assert.*; import org.junit.Test; publicclassInfoTest{ @Test publicvoid testInfo(){ Info tempInfo =newInfo(); assertNotNull(tempInfo.tmp); } @Test publicvoid testInsert(){ Info tempInfo =newInfo(); // Insert into an empty list tempInfo.insert(30); assertEquals(30, tempInfo.get(0)); // Insert an item to be placed at the beginning of the list tempInfo.insert(4); assertEquals(4, tempInfo.get(0)); assertEquals(30, tempInfo.get(1)); // Insert an item to be placed at the end of the list tempInfo.insert(20); assertEquals(20, tempInfo.get(1)); assertEquals(30, tempInfo.get(2)); // Insert an which already exists tempInfo.insert(20); assertEquals(4, tempInfo.get(0)); assertEquals(20, tempInfo.get(1)); assertEquals(30, tempInfo.get(2)); } @Test publicvoid testDelete(){ Info tempInfo =newInfo(); tempInfo.insert(15); tempInfo.insert(5); tempInfo.insert(10); // delete from the middle tempInfo.delete(10); assertEquals(5, tempInfo.get(0)); assertEquals(15, tempInfo.get(1)); // delete from the beginning tempInfo.insert(10); tempInfo.delete(5); assertEquals(10, tempInfo.get(0)); assertEquals(15, tempInfo.get(1)); // delete from the end tempInfo.insert(5); tempInfo.delete(15); assertEquals(5, tempInfo.get(0)); assertEquals(10, tempInfo.get(1)); // delete something that does not exist tempInfo.insert(15); tempInfo.delete(7); assertEquals(5, tempInfo.get(0)); assertEquals(10, tempInfo.get(1)); assertEquals(15, tempInfo.get(1)); } @Test publicvoid testGet(){ Info tempInfo =newInfo(); tempInfo.insert(15); tempInfo.insert(5); tempInfo.insert(10); // get items at the beginning, middle, and end of the list assertEquals(5, tempInfo.get(0)); assertEquals(10, tempInfo.get(1)); assertEquals(15, tempInfo.get(2)); // get an unexisting item assertNull(tempInfo.get(3)); } @Test publicvoid testCount(){ Info tempInfo =newInfo(); / ...

Use the following data set that compares age to average years lef.docx

dickonsondorris

Complete skeletonimport java.util.ArrayList; public class My.pdf

arhamnighty

Exceptions, I/O and Threads Input and Output in Java: The File Class, Standard Streams, Keyboard Input, File I/O Using Byte Streams, Character Streams, File I/O Using Character Streams - Buffered Streams, File I/O Using a Buffered Stream, Keyboard Input Using a Buffered Stream,Writing Text Files. Threads: Threads vs. Processes, Creating Threads by Extending Thread, Creating Threads by Implementing Runnable, Advantages of Using Threads, Daemon Threads, Thread States, Thread Problems, Synchronization. Exceptions: Exception Handling, The Exception Hierarchy, throws statement, throw statement, Developing user defined Exception Classes- The finally Block.

Java 3 Computer Science.pptx

MUHAMMED MASHAHIL PUKKUNNUMMAL

Ähnlich wie 4.20 LAB Zip code and population (generic types) JAVADefine a cla.pdf (20)