Answered: java program

Engineering

Computer Science

java program

EBK JAVA PROGRAMMING

8th Edition

ISBN:9781305480537

Author:FARRELL

Publisher:FARRELL

Chapter16: Graphics

Section: Chapter Questions

Problem 1DE

See similar textbooks

Similar questions

Write a test client TestBinarySearch.java for use in testing the implementations of min(), max(), floor(), ceiling(), select(), rank(),deleteMin(), deleteMax(), and keys() that are given in the text. Start with the standard indexing client given on page 370. Add code to take additional command-line arguments, as appropriate.Write a test client TestBinarySearch.java for use in testing the implementations of min(), max(), floor(), ceiling(), select(), rank(),deleteMin(), deleteMax(), and keys() that are given in the text. Start with the standard indexing client given on page 370. Add code to take additional command-line arguments, as appropriate.Write a test client TestBinarySearch.java for use in testing the implementations of min(), max(), floor(), ceiling(), select(), rank(),deleteMin(), deleteMax(), and keys() that are given in the text. Start with the standard indexing client given on page 370. Add code to take additional command-line arguments, as appropriate.Write a test client…
Modify java code for Hw5 (stock,each csv file has headings: Date,Open,High,Low,Close, Adj Close,Volume) to count and print the number of days there is gain (increase from open to close price) of 2% or more of stock price. Also count and print the number of days the High is 30% bigger than Low. Also, find and print the average volume for the trading days where there is gain. Make sure each print occupies a single line, and all lines are lined up such that the label for each information requested is left aligned, and the decimal points are all aligned. import java.util.*; import java.io.*; public class StockData { public static double average(ArrayList<Double> prices) { double total = 0; double average; for (int i = 0; i < prices.size(); i++) { total = total + prices.get(i); } if (prices.size() > 0) { average = total / prices.size(); return average; } else { return 0; } } public static double min(ArrayList<Double>prices) { double min = prices.get(0); for (int i = 1; i…
Language - Java Create a utility class called DuplicateCounter. Create an instance method called count that takes a single parameter called dataFile (representing the path to a text file) and uses a Map of Strings to count how many times each word occurs in dataFile. The counts should be stored in an instance variable called wordCounter. Create an instance method called write that takes a single parameter called outputFile (representing the path to a text file) and writes the contents of wordCounter to the file pointed to by outputFile. The output file should be overwritten if it already exists, and created if it does not exist. Create a separate class called Application that contains a main method which illustrates the use of DuplicateCounter by calling both the remove and write methods. Your input file must be called problem2.txt and your output file must be called unique_word_counts.tx
FOR JAVA, JUST FILL THIS CODE ABOUT THE QUESTIONS BELOW IT IN 50 MINUTES PLEASE. !!! import java.util.ArrayList; public class University { } // SERVER-SIDE class ServerTeacher { // port: the port number to be allocated // students: list of the students having id and grade information private int port; private ArrayList<Student> students; public ServerTeacher(int port, ArrayList<Student> students) { this.port = port; this.students = students; } // find the grade of the student whose id given, if student couldn't find then return -1 public int findGrade(int id) { // *** FILL THIS METHOD FOR PART 1 *** // } // open the server listen for the student ask their grades public int respondStudent() { // *** FILL THIS METHOD FOR PART 2 *** // } } // CLIENT-SIDE class ClientStudent { private int port; // the port number to be allocated public ClientStudent(int port) { this.port = port; } // open client and ask the student's grade to server public…
Given a list of employees, create a simple JAVA program that allows the user to insert, delete, display,and search an employee. The program should input 10 full names of employees with employee number as linked list. Also, a list of menus should be displayed. These menus are Insert, Delete, Display and Search. A. Insert - allows the user to insert one employee at a time with corresponding ID number which serves as their link. All employees to be inserted must be inserted at the end of the list. B. Delete – allows the user to delete the employee from the list C. Display – allows the user to display the list of employees D. Search - allows the user to find a certain employee These menus should be in loop once you test every operation based on the listed menu. Use linked list as a data structure in generating a list of employees.
In python >>> build_csv_string([["Sam", "Lab 01", 5.4]]) 'name,assignment,grade\nSam,Lab 01,5.4' >>> build_csv_string([["Sam", "Lab 01", 5.4], ["Zoe"]]) 'name,assignment,grade\nSam,Lab 01,5.4\nZoe,N/A,0' >>> build_csv_string([["Sam", "Lab 01", 5.4], ["Zoe"], ["Amanda", "Quiz 04", 100]]) 'name,assignment,grade\nSam,Lab 01,5.4\nZoe,N/A,0\nAmanda,Quiz 04,100'
Which of the following are true? The Serializable interface has no methods. The Serializable method has been deprecated (fallen into disfavor) because it transmits data as a byte stream. All classes implement the Serializable interface by default. a and b are both true.
Please do this in java In many computer systems and networks, different users are granted different levels of access to different resources. In this case, you are given a int[] rights, indicating the privilege level of each user to use some system resource. You are also given a int minPermission, which is the minimum permission a user must have to use this resource. YouaretoreturnaStringindicatingwhichuserscanand cannot access this resource. Each character in the return value corresponds to the element of users with the same index. 'A' indicates the user is allowed access, while 'D' indicates the user is denied access. Constraints users will contain between 0 and 50 elements, inclusive. Each element of users will be between 0 and 100, inclusive. minPermission will be between 0 and 100, inclusive. Examples a) {0,1,2,3,4,5} 2 Returns: "DDAAAA" Here, the first two users don't have sufficient privileges, but the remainder do. b) {5,3,2,10,0} 20 Returns: "DDDDD"…
JAVA PROGRAM ASAP Please give me a new program ASAP BECAUSE the program down below does not pass all the test cases when I upload it to hypergrade. The program must pass the test case when uploaded to Hypergrade. I have provided the failed test cases as a screenshot. import java.util.HashMap;import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.Scanner;public class MorseCodeConverter { private static HashMap<Character, String> morseMap = new HashMap<>(); public static void main(String[] args) { loadMorseCodes(); Scanner scanner = new Scanner(System.in); System.out.println("Please enter a string to convert to Morse code:"); String input = scanner.nextLine().toUpperCase(); String morseCode = convertToMorse(input); System.out.println(morseCode); } private static void loadMorseCodes() { try (BufferedReader reader = new BufferedReader(new FileReader("morse.txt"))) {…
JAVA PROGRAM ASAP Please Modify this program ASAP BECAUSE it does not pass all the test cases when I upload it to hypergrade Please modify so it passes all the test cases because it says 0 out of 2 passed. The program must pass the test case when uploaded to Hypergrade. Thank you import java.util.HashMap;import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.Scanner;public class MorseCodeConverter { private static HashMap<Character, String> morseMap = new HashMap<>(); public static void main(String[] args) { loadMorseCodes(); Scanner scanner = new Scanner(System.in); System.out.println("Please enter a string to convert to Morse code:"); String input = scanner.nextLine().toUpperCase(); String morseCode = convertToMorse(input); System.out.println(morseCode); } private static void loadMorseCodes() { try (BufferedReader reader = new BufferedReader(new…
Java: Below are 3 java files along with a text file. Make sure in the console, shank.txt is read into tokens. Make sure to show the 3 java files with the screenshot of shank.txt being printed out in the console. The output must show shank.txt being printed out in tokens. There must be no error at all. Main.java import java.io.IOException;import java.nio.file.Files;import java.nio.file.Paths;import java.util.List; public class Shank { public static void main(String[] args) { if (args.length != 1) { System.out.println("Error: Exactly one argument is required."); System.exit(0); } String filename = args[0]; try { List<String> lines = Files.readAllLines(Paths.get(filename)); Lexer lexer = new Lexer(); for (String line : lines) { try { List<Token> tokens = lexer.lex(line); for (Token token : tokens) { System.out.println(token); } } catch (Exception e) { System.out.println("Exception: " + e.getMessage()); } } }…
Write a java (Java 7 ) program for this :-- A new deadly virus has infected large population of a planet. A brilliant scientist has discovered a new strain of virus which can cure this disease. Vaccine produced from this virus has various strength depending on midichlorians count. A person is cured only if midichlorians count in vaccine batch is more than midichlorians count of person. A doctor receives a new set of report which contains midichlorians count of each infected patient, Practo stores all vaccine doctor has and their midichlorians count. You need to determine if doctor can save all patients with the vaccines he has. The number of vaccines and patients are equal. Input Format First line contains the number of vaccines - N. Second line contains N integers, which are strength of vaccines. Third line contains N integers, which are midichlorians count of patients. Output Format Print a single line containing ′Yes′ or ′No′. Input Constraint 1<N<10 Strength of vaccines…