Write a program that reads a list of words. The program should output those words and their frequencies. The input begins with an integer indicating the number of words that follow.For example, If the input is:5heyhiMarkhimark the output of main is:Word: hey Frequency: 1Word: hi Frequency: 2Word: Mark Frequency: 1Word: mark Frequency: 1 35/*о 32 А 1236Go through every element in String[] line and find all37words3839input:40String[] line: Array of words41output:42ArrayList: An Arraylist containing all the unique words in line4344hint: Arraylists have a method called contains45*/public static ArrayList get_unique_words(String[] line)4647{48495051public static void main(String[] args)52{53int numwords;// Implement a Scanner (call it input)545556// Get an int from the Scanner and save it to numwords575859String[] line = get_words (input, numwords);60ArrayList unique_words = get_unique_words(line);61for (int i=0;i< unique_words.size();i++)62{63int frequency =get_word_frequencies(unique_words.get(i),line);System.out.println("Word:+ unique_words.get(i) + "\tFrequency:+ frequency);6465666768 1Gimport java.util.ArrayList;9 322Aimport java.util.Scanner;45 >public class FrequencyList6.{/*8.Given a single String word, traverse the String[] line9to find the number of times word is given in line1011input:12String word: Word we are looking for13String[] line: Array of words14output:15int: frequency of word in the array line16*/public static int get_word_frequencies(String word, String[] line)1718{1920}212223Create a String[] of size numwords that is populated with words a scanner2425input:26int numwords: the number of words to be expected as input27output:28String[]: Array of words that is recieved from user via Scanner2930*/31public static String[] get_words(Scanner input, int numwords){323334

Here I have defined the three methods. In the method get_word_frequencies(), I have iterated over…

Write a program that reads a list of words. The program should output those words and their frequencies. The input begins with an integer indicating the number of words that follow. For example, If the input is: 5 hey hi Mark hi mark the output of main is: Word: hey Frequency: 1 Word: hi Frequency: 2 Word: Mark Frequency: 1 Word: mark Frequency: 1

Write a program that reads a list of words. The program should output those words and their frequencies. The input begins with an integer indicating the number of words that follow. For example, If the input is: 5 hey hi Mark hi mark the output of main is: Word: hey Frequency: 1 Word: hi Frequency: 2 Word: Mark Frequency: 1 Word: mark Frequency: 1

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

Write Java statements to add the integers 1001, 1100, and 1110 to the resulting ArrayList import java.util.*;public class test { public static void main(String[] args) { //Set n =25 int n = 25; //ArrayList of Integer type with size,n=25 ArrayList<Integer> list = new ArrayList<Integer>(n); for(int i = 0;i<n;i++){ //Assign -1 to all the objects of the array list,list list.add(-1); } //Add 1001 to the list list.add(1001); //Add 1100 to the list list.add(1100); //Add 1110 to the list list.add(1110); //Reset the number of elements in the list becomes 28 //Use size() method to get the size of the list. n=list.size(); //for loop to print the list for(int i = 0;i<n;i++){ System.out.print(list.get(i) + " "); } }} 1. Write the Java statement to display the size of the resulting ArrayList from above.
2 Write a java program. call it sortWords. Read from the command line a list of words, any number, from 1 to as many as the user wants. Store the words (strings) in an arraylist. Sort the list in alphabetical order. Print the list with a comma and space between each word. Words should be output in the SAME case as the user gives them. For an A make the sort be case insensitive AND remove the , from after the last word. example: java sortWords book car tree apple house --> apple, book, car, house, tree (The already existing answer on Chegg failed the codePost tests)
import java.util.ArrayList;import java.util.Arrays; public class PS07A{/*** Write the method named mesh.* * Start with two ArrayLists of String, A and B, each with * its elements in alphabetical order and without any duplicates. * Return a new list containing the first N elements from the two * lists. The result list should be in alphabetical order and without * duplicates. A and B will both have a size which is N or more. * Your solution should make a single pass over A and B, taking * advantage of the fact that they are in alphabetical order, * copying elements directly to the new list.* * Remember, to see if one String is "greater than" or "less than" * another, you need to use the compareTo() method, not the < or > * operators. * * Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]* * @param a an ArrayList of String in alphabetical…
import java.util.*;class Arraylist{public static void main(String args[]){ArrayList obj = new ArrayList();obj.add("A");obj.add("B");obj.add("C");obj.add(1, "D");System.out.println(obj);}} What will the given code prints on the output screen.
java getDup accepts an array and returns an int. If there is any element is duplicated, the method counts how many of those present in the array. Example : getDup(["1","2","aa"',"1"]) returns:2 ("1" is duplicated and there are two "1"s so return is 2) class Main { public static int getDup(String[] r) { } public static void main(String[] args) { Scanner in = new Scanner(System.in); String [] strs = new String[in.nextInt()]; for(int i=0; i < strs.length; i++) { strs[i] = in.next(); } System.out.println(getDup(strs)); } } hint: you will need a nested array the will run on the array we get from the method argument. inside the nested loop you will need to check if the main array element is equal to the current
import java.util.ArrayList;import java.util.Arrays;public class PS{/*** Write the method named mesh.** Start with two ArrayLists of String, A and B, each with* its elements in alphabetical order and without any duplicates.* Return a new list containing the first N elements from the two* lists. The result list should be in alphabetical order and without* duplicates. A and B will both have a size which is N or more.* Your solution should make a single pass over A and B, taking* advantage of the fact that they are in alphabetical order,* copying elements directly to the new list.** Remember, to see if one String is "greater than" or "less than"* another, you need to use the compareTo() method, not the < or >* operators.** Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]** @param a an ArrayList of String in alphabetical order.* @param b an…
Write a for loop to initialize the objects in the ArrayList created in question number 2 above to -1. import java.util.*; public class test { public static void main(String[] args) { int n = 25; ArrayList<Integer> list = new ArrayList<Integer>(n); for(int i = 0;i<n;i++){ list.add(-1); } for(int i = 0;i<n;i++){ System.out.print(list.get(i) + " "); } } } Write Java statements to add the integers 1001, 1100, and 1110 to the resulting ArrayList .
Please help me fix this code Make it run out like the picture import java.util.ArrayList; import java.util.Random; import java.util.Scanner; public class FrogListApp { public static void main(String[] args) { final int MIN_WEIGHT = 1; final int MAX_WEIGHT = 25; // Step 3: Create an array list to store Frog objects ArrayList frogsList = new ArrayList<>(); // Step 4: Create a Scanner object Scanner scanner = new Scanner(System.in); // Step 5: Read an integer as the number of frogs // using prompt "Enter the number of frogs: " System.out.print("Enter the number of frogs: "); int numberOfFrogs = scanner.nextInt(); // Step 6: Read an integer as the random generator seed // using prompt…
in java language import java.util.ArrayList;import java.util.Arrays; Write the method named mesh.* * Start with two ArrayLists of String, A and B, each with * its elements in alphabetical order and without any duplicates. * Return a new list containing the first N elements from the two * lists. The result list should be in alphabetical order and without * duplicates. A and B will both have a size which is N or more. * Your solution should make a single pass over A and B, taking * advantage of the fact that they are in alphabetical order, * copying elements directly to the new list.* * Remember, to see if one String is "greater than" or "less than" * another, you need to use the compareTo() method, not the < or > * operators. * * Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]* * @param a an ArrayList of String in alphabetical order.*…
java Create a static method that: is called removeAll returns ArrayList<String> takes two parameters: an ArrayList of Strings called wordList, and a String called targetWord This method should go through every element of wordList and remove every instance of targetWord from the ArrayList. Example: ArrayList<String> wordList = new ArrayList<String>(Arrays.asList("hi","hey","hi","yo")); removeAll(wordList,"hi"); wordList: ["hey","yo"] public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); String target = in.next(); ArrayList<String> list = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.next()); } System.out.println(removeAll(list, target)); } }
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…
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()); } }