Write a Java program to read data from a text file: Java Programming Help

Objectives

To show that we learned several programming concepts, including:

  1. How to process String’s.

  2. How to create and use methods.

  3. How to process array’s and List’s.

  4. How to use loop and if statements.

  5. How to read data from a file.

  6. How to read data from the command line.


Description

Write a Java program to read data from a text file (file name given on command line), process the text file by performing the following:

  1. Print the total number of words in the file.

  2. Print the total number of unique words (case sensitive) in the file.

  3. Print all words in ascending order without duplication, i.e. all unique words.

  4. Print all line(s) with line number(s) of the file where a specific phrase is found. You must prompt the user to enter a specific phrase to search for. Under each output line indicate

  5. the location(s) of the first character of the matched phrase (refer to the Sample Ouput below).

  6. After outputting results keep prompting user until the user enters EINPUT.


The file that is to be read is given to you in learn.cnm.edu. The file name is random.txt. This is the file you should use for the project.


Requirements

  1. The java source file MUST abide by the google java style guide. It can be found at https://google.github.io/styleguide/javaguide.html#s7.1-javadoc-formatting\

  2. You must enter a javadoc comment before EACH method declaration. In the comment you must provide a small description of this method, specify the parameters and what the method returns. Follow the template below:

/**

* <write your description of method here>

* @param <parameter name here> <write description of parameter is here>

* @return <write description of what is returned here>

*/

3. You must handle all Checked Exceptions appropriately:

a. Must output an appropriate message.

b. Must put the program into a state in which the user can recover from or exit if . necessary.


4. There must be at a minimum the following methods:

a. (10pts) Name: main

i. Description: The main method should do the following.

1. Retrieve the file name from the command line.

2. The program should exit if the file does not exist or if the file name is

not given on the command line. When exiting the program should print

the message “File does not exist.”


3. If the file exists the main method should call the processFile method.

Any data that is needed from the main method must be passed to the

processFile method via its parameters. See processFile method below.


b. (30pts) Name: processFile

i. Description: The processFile method should do the following:


a. Read contents from the file.

b. Print the total number of words in the file.

c. Print the total number of unique words (case sensitive) in the

file. In order to do part “c” you must call the createUniqueList

method.

d. Print all words in ascending order without duplication. In order

to do part “d” you must call the sortList method.


Once the information above is printed to the console the processFile method

should call the search method. Any data that is needed from the processFile

method must be passed to the search method via its parameters.


c. (10 pts) Name: createUniqueList

i. Description: The createUniqueList method should receive as input a List of

words that are not unique, i.e. there are duplicate words in the List. The method

must create a new List by adding only unique words from the input List.

1. Parameter

a. Name: wordList

b. Type: ArrayList<String>

c. Description: a list that has duplicate words

2. Return

a. Type: ArrayList<String>

b. Description: a list of non-duplicate words


d. (15 pts) Name: sortList

i. Description: The sortList method should receive as input a List of unsorted

words. The sortList method should modify the unsorted List into a sorted List.

You must implement a sort algorithm. You can choose any sorting algorithm you want.

1. Parameter

a. Name: uniqueWordList

b. Type: ArrayList<String>

c. Description: a list of un-sorted words

2. Return

a. ArrayList<String>

b. Description: a list of sorted words


e. (35pts) Name: search

i. Description: The search method should prompt the user for a search phrase.

Given the search phrase the search method should search each line in the file

for the location of the phrase on each line. If the search phrase is not found on a line then just go to the next line. The search method must find every occurrence of the phrase on a line. The search method should print the line number, the line and the location of the search phrase (“use ^”). After all lines have been searched the search method then prompts the user to enter another search.The search method does not exit until the user enters the phrase

EINPUT. See Sample Output.


5. The output should match the format of the Sample Output.


Sample Output

Total number of words in file: 114

Total number of unique words in file: 105

Unique words of the input file in ascending order:

Abode

Added

Advantages

Alteration

amiable

and

any

Are

at

better

between

boisterous

boy

by

collected

collecting

companions

considered

contented

day

deal

delight

design

diminution

discovered

do

early

easy

end

entire

ever

excellence

fancy

first

former

forming

forth

fortune

garrets

get

greater

happiness

he

Her

horses

hours

how

if

is

its

jokes

joy

Justice


Leaf

led

left

many

mile

morning

new

no

nor

norland

not

Nothing

now

of

off

oh

old

our

Out

own

partiality

parties

placing

Pursuit

put

quiet

reasonable

shade

she

should

shy

Sigh

Sincerity

So

so

Square

staying

to

towards

two

unsatiable

Up

use

waiting

warrant

way

whole

winding

wishing

woman

ye

you

Enter Search Pattern: he

Line number 1

Her old collecting she considered discovered.

^

Line number 2

So at parties he warrant oh staying. Square new horses and put better end.

^

Line number 8


Pursuit he he garrets greater towards amiable so placing.

^ ^

Line number 9

Nothing off how norland delight. Abode shy shade she hours forth its use.

^

Enter Search Pattern: e

Line number 1

Her old collecting she considered discovered.

^ ^ ^ ^ ^ ^ ^

Line number 2

So at parties he warrant oh staying. Square new horses and put better end.

^ ^ ^ ^ ^ ^ ^ ^

Line number 3

Sincerity collected happiness do is contented.

^ ^ ^ ^ ^ ^

Line number 4

Sigh ever way now many. Alteration you any nor unsatiable diminution reasonable

companions shy partiality. Leaf by left deal mile oh if easy.

^ ^ ^ ^ ^ ^

^ ^ ^ ^ ^

Line number 5

Added woman first get led joy not early jokes.

^ ^ ^ ^ ^

Line number 6

Are own design entire former get should.

^ ^ ^ ^ ^ ^

Line number 7

Advantages boisterous day excellence boy. Out between our two waiting wishing.

^ ^ ^ ^ ^ ^ ^ ^^

Line number 8

Pursuit he he garrets greater towards amiable so placing.

^ ^ ^ ^ ^ ^

Line number 9

Nothing off how norland delight. Abode shy shade she hours forth its use.

^ ^ ^ ^ ^

Line number 10

Up whole of fancy ye quiet do. Justice fortune no to is if winding morning forming.

^ ^ ^ ^ ^

Enter Search Pattern: EINPUT

Bye!

Testing

I will test your program as follows:

javac Project_<your email id>.java

java Project_<your email id> random.txt

I will use the random.txt file given as part of the project in learn.cnm.edu to test your code.


get this assignment solution or Send your project/assignment directly at codersarts@gmail.com

Contact Us

Tel: (+91) 0120  4118730  

Time :   10 : 00  AM -  08 : 00 PM IST 

Registered address: G-69, Sector 63, 

 Noida - 201301, India

We Provide Services Across The different countries

USA    Australia   Canada   UK    UAE    Singapore   New Zealand    Malasia   India   Ireland   Germany

CodersArts is a Product by Sofstack Technology Solutions Pvt. Ltd.

  • CodersArts | Linkedin
  • Instagram