mcq NameSorter.javaName.javaimport java.util.Scanner;import java.util.ArrayList;import java.util.Collections;public class NameSorter {public static void main (String [] args) {Scanner scnr = new Scanner (System.in);Inputfinal int NUM ELEMENTS = 4;Ethan PhegleyName newName;Ethan KreiderArrayList userNames = new ArrayList ();String firString lastName;Name;Chris KreiderGinny Edgerint i;for (i = 0; i < NUM_ELEMENTS; ++i) {firstName = scnr.next ();lastName = scnr.next ();newName = new Name (firstName, lastName);userNames.add (newName);Output}Collections.sort (userNames);for (i = 0; i < NUM_ELEMENTS; ++i) {System.out.printin (userNames.get (i) );}} NameSorter.javaName.javapublic class Name implements Comparable {private String firstName;private String lastName;Name (String firstName, String lastName) {Inputthis.firstName = firstName;this.lastName = lastName;Ethan PhegleyEthan KreiderCoverridepublic int compareTo (Name otherName) {int comparisonVal;Chris KreiderGinny EdgercomparisonVal = lastName.compareTo (otherName.lastName);if (comparisonVal != 0) {return comparisonVal;}else {return firstName.compareTo (otherName.firstName);Output@Overridepublic String tostring () {return lastName +firstName;

NameSorter.java Name.java import java.util.Scanner; import java.util.ArrayList; import java.util.Collections; public class NameSorter { public static void main (String [] args) { Scanner scnr = new Scanner (System.in); final int NUM_ELEMENTS = 4; Name newName; ArrayList userNames = new ArrayList (); String firstName; String lastName; Input Ethan Phegley Ethan Kreider Chris Kreider Ginny Edger int i; for (i = 0; i < NUM_ELEMENTS; ++i) { firstName - scnr.next (); lastName - scnr.next (); newName - new Name (firstName, lastName); userNames.add (newName); Output Collections.sort (userNames); for (1 - 0; i < NUM_ELEMENTS; ++1) { System.out.println (userNames.get (i));

NameSorter.java Name.java import java.util.Scanner; import java.util.ArrayList; import java.util.Collections; public class NameSorter { public static void main (String [] args) { Scanner scnr = new Scanner (System.in); final int NUM_ELEMENTS = 4; Name newName; ArrayList userNames = new ArrayList (); String firstName; String lastName; Input Ethan Phegley Ethan Kreider Chris Kreider Ginny Edger int i; for (i = 0; i < NUM_ELEMENTS; ++i) { firstName - scnr.next (); lastName - scnr.next (); newName - new Name (firstName, lastName); userNames.add (newName); Output Collections.sort (userNames); for (1 - 0; i < NUM_ELEMENTS; ++1) { System.out.println (userNames.get (i));

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

In java A supermarket wants to reward its best customer of each day, showing the customer’s name on a screen in the supermarket. For that purpose, the store keeps an ArrayList.Create a class customer having id, name, gender, and bill provide appropriate getters/setters and constructors also provide toString method.In the Store class, make an ArrayList of customers, store name, and address implement methods public void addSale(Customer c) that will add customers to the arraylist.public void RemoveCustomer(int id);public void UpdateCustomerRecord(int Id);public displayAll();public String nameOfBestCustomer() to record the sale and return the name of the customer with the largest sale. public ArrayList nameOfBestCustomers(int topN) so that it displays the top customers, that is, the topN customers with the largest sales, where topN is a value that the user of the program supplies.  Write a program that prompts following menu and   ============================================…
Implement a class CountingArrayList that extends ArrayList<String> and that counts the number of calls to get and set. import java.util.ArrayList;import java.util.Collections; public class CountingArrayListTester{ public static String smallest(ArrayList<String> values) { String smallestSoFar = values.get(0); for (int i = 1; i < values.size(); i++) { String value = values.get(i); if (value.compareTo(smallestSoFar) < 0) { smallestSoFar = value; } } return smallestSoFar; }    public static void main(String[] args) { CountingArrayList words = new CountingArrayList(); words.add("Mary"); words.add("had"); words.add("a"); words.add("little"); words.add("lamb"); words.add("its"); words.add("fleece"); words.add("was"); words.add("white"); words.add("as"); words.add("snow"); String smallest = smallest(words);…
Add unit testing to the textanalyzer class. Please perform this task using JUnit. import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.Set; import java.io.*; public class TextAnalyzer { public static void main(String[] args) throws Exception {    String Word;    URL poem = new URL("https://www.gutenberg.org/files/1065/1065-h/1065-h.htm"); BufferedReader in = new BufferedReader( new InputStreamReader(poem.openStream()));       Map map = new HashMap();    while ((Word = in.readLine()) != null)    {    String[] words = Word.split("[\\s.;,?:!()\"]+");    for (String word : words) {    word = word.trim();    if (word.length() > 0) {    if (map.containsKey(word)) {    map.put(word, map.get(word) + 1);    } else {    map.put(word, (int) 1L);    }    }    }    } // retrieving the map contents Set> set = map.entrySet(); // make an array list List> sortedList = new…
Complete this code in Java import java.util.Scanner; import java.util.ArrayList; public class SET { ArrayListlist; int length; public SET(); { list=new ArrayList<>(10); length=0; } public SET(int cap) { list=new arrayList<>(cap); length=0; } public int getLength() { return length; } } public class SetApplication { public static void main(String[] args) { SET st=new SET(); System.out.println(st.getLength()); } }
I need help with my Optimizing the intermediate code to improve the efficiency of the generated machine code. I need to improve the effixiency of the generated machine code import java.util.*; public class SimpleCalculator { private final String input; private int position; private boolean hasDivByZero = false; private Map<String, String> symbolTable; private List<String> instructions; public SimpleCalculator(String input) { this.input = input; this.position = 0; this.symbolTable = new HashMap<>(); this.instructions = new ArrayList<>(); } public static void main(String[] args) { SimpleCalculator calculator = new SimpleCalculator("3 + 5 * (2 - 1)"); calculator.parseExpression(); if (calculator.hasDivByZero) { System.out.println("Error: division by zero"); } else { System.out.println("Result: " + calculator.instructions); } } public void parseExpression() { String t1 = parseTerm(); while (true) { String op = null; if (consume('+')) { op = "+"; } else if…
[JAVA] Please provide comments to my code import java.util.ArrayList;import java.util.HashMap;import java.util.Objects;public class Land {public HashMap<Integer, String[]> map = new HashMap<>();public ArrayList<Goblin> allGoblins = new ArrayList<>();public ArrayList<Treasure> allTreasures = new ArrayList<>();public Human player;public Land() {int i = 1;while (i <= 23) {if (i == 1 || i == 23) {String[] topAndBottomArray = {"-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-","-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-", "-"};this.map.put(i, topAndBottomArray);} elsethis.map.put(i, new String[] { "|", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*","*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "*", "|" });i++;}String[] temp = this.map.get(12);temp[15] = "H";this.map.put(12, temp);}public ArrayList<int[]> addGoblins(int totalNum)…
Review: 4. What is the output of below javacode? ___________import java.util.*;class Array{public static void main(String args[]){int array[] = new int [5];for (int i = 5; i > 0; i--)array[5-i] = i;Arrays.fill(array, 1, 4, 8);for (int i = 0; i < 5 ; i++)System.out.print(array[i]);}} 5. Complete the sentence: The type parameter section is surrounded by ________.6. A method that introduces its own type parameter is a generic method. True/False.7. Complete the sentence: Generic type parameters can be restricted to a group of types that implement a given interface. You can do that byusing the keyword__________.8. Type parameters can represent ( stand for) reference types as well as primitive types. True/false.
java Create a static method that: is called repeatAll returns ArrayList of Booleans takes in a single parameter - an ArrayList of Booleans This method should modify its ArrayList parameter by repeating its ArrayList values. For example, if the parameter is (true, false, false) The modified ArrayList should be (true, false, false, true, false, false) public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); ArrayList<Boolean> list = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.nextBoolean()); } System.out.println(repeatAll(list)); } }
Write a Java class Course for dealing with courses. Your class must have the following features: Course - name: String - lineNumber: int - symbol: String - sections: ArrayList + Course() + Course(name: String, lineNumber: int, symbol: String) + getName(): String + getLineNumber(): int + getSymbol(): String + getSections(): ArrayList + addSection(section: Section): void + Override toString() method: you have to return needed data Fields values. addSection(section: Section) method add a section (number and the teacher for this section) to the array list of sections. Note: sectionNumber will be generated automatically. Write a Java class Section for dealing. Your class must have the following features: Section - number: int - teacher: Teacher - students: ArrayList + Section() + Section(number: int, techer: Teacher) + getNumber(): int + getTeacher(): Teacher + getStudents(): ArrayList + addStudent(student: Student): void + Override toString() method: you have to return needed data…
In java, Implement a method that removes all duplicates. Keep the first instance of the element but remove all subsequent duplicate elements.public void removeDuplicates() see the picture for the right output. Given files: Demo6.java public class Demo6 { public static void main(String[] args) { MyLinkedList<String> list = new MyLinkedList<>(); TestBench.addToList(list); TestBench.addToList(list); TestBench.addToList(list); TestBench.addToList(list); for (int x = 0; x < list.size(); x += 1 + x/3) { System.out.println("Removing element at index: " + x); list.remove(x); } System.out.println("Result"); System.out.println(list); System.out.println("Shuffling"); list.shuffle(7777); System.out.println(list); System.out.println("Removing duplicates (keeping first instance)"); list.removeDuplicates(); System.out.println(list); }} TestBench.java import java.util.AbstractList; public class TestBench { public static…
StringSorter.java is below: import java.io.*; // for Reader (and subclasses), Writer (and subclasses) and IOExceptionimport java.util.*; // for List, ArrayList, Iterator public class StringSorter { ArrayList lines; // given that we don't really know how to deal with a read/write error (IOException) // inside the functions, we'll let it pass through public void readFromStream(Reader r) throws IOException { BufferedReader br=new BufferedReader(r); lines=new ArrayList(); while(true) { String input=br.readLine(); if(input==null) break; lines.add(input); } } public void writeToStream(Writer w) throws IOException { PrintWriter pw=new PrintWriter(w); Iterator i=lines.iterator(); while(i.hasNext()) { pw.println((String)(i.next())); } } // returns the index of the largest element in the list static int findIdxBiggest(List l, int from, int to) { String…
import java.util.ArrayList; public class Bus { privateStringname; privateintsize; privateintbasePrice; privateArrayList<Trip>approvedTrips; privateintlevel;// 1,2,3 for low,medium, high repectively; privateintid; privatestaticintnextId=0; privateMinistrymny; protectedStringtripTypes; privateintgetNextId(){ returnnextId++; } publicBus(){ approvedTrips=newArrayList<Trip>(); } publicBus(Stringname,intsize,intbasePrice,intlev,Ministrymny){ approvedTrips=newArrayList<Trip>(); this.name=name; this.size=size; this.basePrice=basePrice; this.level=lev; this.id=getNextId(); this.mny=mny; tripTypes="BASICTRANSPORT"; } publicbooleanavailable(Datedate){ booleanretval=true; for(Tript:approvedTrips) if(t.getDate().getDay()==date.getDay()) retval=false; returnretval; } publicintgetBasePrice(){ returnbasePrice; } publicintgetId(){ returnid; } publicStringgetName(){ returnname; } publicdoublegetSize(){ returnsize; } publicStringtoString(){ returnname; }…