bartleby

Videos

Textbook Question
Book Icon
Chapter 20, Problem 20.1PE

(Display words in ascending alphabetical order) Write a program that reads words from a text file and displays all the words (duplicates allowed) in ascending alphabetical order. The words must start with a letter. The text file is passed as a command-line argument.

Expert Solution & Answer
Check Mark
Program Plan Intro

Display words in ascending alphabetical order

Program plan:

  • Import the required packages into the program.
  • In the main() method,
    • Check whether the argument length is not equal to 1. If yes,
      • Display the error message.
    • Assign the argument 0 as filename.
    • Create a list to hold the words.
    • In try block,
      • Check the matches between the word from file and alphabets.
      • Call the add() method to add the word into list.
    • Catch the exception if error occurs.
    • Call sort() method to sort the list in ascending order.
    • Display the ascending order word.
Program Description Answer

The below program demonstrates to sort the word in ascending order from the file and display that list.

Explanation of Solution

Program:

//Import the java packages

import java.util.*;

import java.io.*;

//Class definition

public class Exercise20_01

{

//Main method

public static void main(String[] args)

{

/*Check whether the argument length is not equal to 1 */

if (args.length != 1) {

//Display the error message

System.out.println("Usage: java Exercise20_01 fullfilename");

System.exit(1);

}

//Assign the argument 0 as filename

String filename = args[0];

// Create a list to hold the words

List<String> list = new ArrayList<>();

//In try block

try {

//Create an object for Scanner class

Scanner in = new Scanner(new File(filename));

//Loop executes until the input from file

while (in.hasNext()) {

//Declare and assign the string //variable

String word = in.next();

//Check matches among the word from //file

if (word.matches("[a-z|A-Z].*"))

/*Call add() method to add the word into list */

list.add(word);

}

}

//Catch the exception

catch (Exception ex) {

//Display the error message

System.err.println(ex);

}

/*Call sort() method to sort the list in ascending order */

Collections.sort(list);

// Display the result

System.out.println("Display words in ascending order ");

//Loop executes until the list

for (String word : list) {

//Display the ascending order word

System.out.println(word);

}

}

}

Sample Output

Input file:

Screenshot of Test.txt file

MyLab Programming with Pearson eText -- Access Card -- for Introduction to Java Programming and Data Structures, Comprehensive Version, Chapter 20, Problem 20.1PE

Command to run the program:

java Exercise20_01 Test.txt

Display words in ascending order

hello

hi

hi

jhon

mercy

welcome

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
No AI USE PLEASE. You are using a web browser to load a webpage. Let’s assume the size of the webpage is negligible. The access link rate of the webserver is 1 Gigabits per second. The IP address for the associated URL is not cached in your local host, so a DNS lookup is necessary to obtain the IP address. Suppose that n DNS servers are visited before your host receives the IP address from DNS; the successive visits incur an RTT of RTT1, . . . , RTTn. Let RTT0 denote the RTT between the local host and the webserver containing the webpage. Now answer the following: 1) Ignore all types of delays at the client and the servers. How much time elapses from when the client clicks on the link of the webpage until the client receives the content of the webpage? 2) Now suppose, the HTML file references 10 additional objects (15 MB each) on the same server. Considering only the transmission delay at the webserver for each of these objects and ignoring all other delays at the host and the servers,…
In a client-server file distribution paradigm, let’s assume the server has an upload rate of 25 Mbps. Each client’s download rate is 3 Mbps. Now consider multiple scenarios where the number of clients is 50, 200, and 1000. For each of these scenarios, consider 2 possible upload rates of each client: 200 Kbps, and 1Mbps. For these 6 combinations of the number of clients and the client-upload rate, what are the minimum distribution times for a file of size 30 Gigabit? Now, if the same file needs to be distributed in a P2P paradigm, what will be the 6 minimum distribution times? Show all calculations and provide detailed explanations. No AI use Please
First study the attached code for a simple internet ping server (UDP_Ping_Server.py). You will have to implement a corresponding client in python. The functionality provided by these programs will be similar to the functionality provided by standard ping programs available in modern operating systems. However, these programs will use a simpler protocol, UDP, rather than the standard Internet Control 1Message Protocol (ICMP) to communicate with each other. The ping protocol allows a client machine to send a packet of data to a remote machine, and have the remote machine return the data back to the client unchanged (an action referred to as echoing). Among other uses, the ping protocol allows hosts to determine round-trip times to other machines. Do not modify the attached server code. In this server code, 30% of the client’s packets are simulated to be lost. The server sits in an infinite loop listening for incoming UDP packets. When a packet comes in and if a randomized integer is…

Chapter 20 Solutions

MyLab Programming with Pearson eText -- Access Card -- for Introduction to Java Programming and Data Structures, Comprehensive Version

Ch. 20.4 - Prob. 20.4.2CPCh. 20.5 - Prob. 20.5.1CPCh. 20.5 - Suppose list1 is a list that contains the strings...Ch. 20.5 - Prob. 20.5.3CPCh. 20.5 - Prob. 20.5.4CPCh. 20.5 - Prob. 20.5.5CPCh. 20.6 - Prob. 20.6.1CPCh. 20.6 - Prob. 20.6.2CPCh. 20.6 - Write a lambda expression to create a comparator...Ch. 20.6 - Prob. 20.6.4CPCh. 20.6 - Write a statement that sorts an array of Point2D...Ch. 20.6 - Write a statement that sorts an ArrayList of...Ch. 20.6 - Write a statement that sorts a two-dimensional...Ch. 20.6 - Write a statement that sorts a two-dimensional...Ch. 20.7 - Are all the methods in the Collections class...Ch. 20.7 - Prob. 20.7.2CPCh. 20.7 - Show the output of the following code: import...Ch. 20.7 - Prob. 20.7.4CPCh. 20.7 - Prob. 20.7.5CPCh. 20.7 - Prob. 20.7.6CPCh. 20.8 - Prob. 20.8.1CPCh. 20.8 - Prob. 20.8.2CPCh. 20.8 - Prob. 20.8.3CPCh. 20.9 - How do you create an instance of Vector? How do...Ch. 20.9 - How do you create an instance of Stack? How do you...Ch. 20.9 - Prob. 20.9.3CPCh. 20.10 - Prob. 20.10.1CPCh. 20.10 - Prob. 20.10.2CPCh. 20.10 - Prob. 20.10.3CPCh. 20.11 - Can the EvaluateExpression program evaluate the...Ch. 20.11 - Prob. 20.11.2CPCh. 20.11 - If you enter an expression "4 + 5 5 5", the...Ch. 20 - (Display words in ascending alphabetical order)...Ch. 20 - (Store numbers in a linked list) Write a program...Ch. 20 - (Guessing the capitals) Rewrite Programming...Ch. 20 - (Sort points in a plane) Write a program that...Ch. 20 - (Combine colliding bouncing balls) The example in...Ch. 20 - (Game: lottery) Revise Programming Exercise 3.15...Ch. 20 - Prob. 20.9PECh. 20 - Prob. 20.10PECh. 20 - (Match grouping symbols) A Java program contains...Ch. 20 - Prob. 20.12PECh. 20 - Prob. 20.14PECh. 20 - Prob. 20.16PECh. 20 - (Directory size) Listing 18.10,...Ch. 20 - Prob. 20.20PECh. 20 - (Nonrecursive Tower of Hanoi) Implement the...Ch. 20 - Evaluate expression Modify Listing 20.12,...

Additional Engineering Textbook Solutions

Find more solutions based on key concepts
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
C++ Programming Tutorial 36 - Intro to Loops; Author: Caleb Curry;https://www.youtube.com/watch?v=M3o7Y0juEP0;License: Standard YouTube License, CC-BY