En cours

3 small Java Solutions

The seperate solutions

#1 Write a program that reads text from [url removed, login to view] and breaks it up into individual words. Insert the words into a tree set. At the end of the input file, print all words, followed by the size of the resulting set. This program determines how many unique words a text file has.

#2 Write a program that reads a Java source file and produces an index of all identifiers in the file. For each identifier, print all lines in which it occurs. Hint: Call [url removed, login to view]("[^A-Za-Z0-9_]+"). Then each call to next returns a string consisting only of letters, numbers, and underscores.

#3 Try to find two words with the same hash code in a large file, such as the /usr/share/dict/words file on a Linux system. Keep a Map<Integer, HashSet<String>>. When you read in a word, compute its hash code h and put the work in the set whose key is h. Then iterate through all keys and print the sets whose size is > 1.

Compétences : Java

Voir plus : tree insert, tree index, string source code java, string hash, map string, java program solutions, index tree, find solutions, find file linux, hash string integer, hash string, at solutions, work solutions, key identifiers, find write letters, solutions, java small, java hash, it solutions, write java program read, text hash, write java file program, linux read text file, string integer, file system java

Concernant l'employeur :
( 2 commentaires ) Stafford, United States

N° du projet : #2330615

Décerné à :

chSoft

I can do this for you. Please check your PMB.

40 $ USD en 1 jour
(5 Commentaires)
3.9

3 freelance ont fait une offre moyenne de 57 $ pour ce travail

javabee4u

Hi, I can give solutions to 3 Java Programs. Thanks

60 $ USD en 1 jour
(4 Commentaires)
3.9
JavaTechieG

Hi, I can give the solution for 3 programs. Thanks

70 $ USD en 1 jour
(0 Commentaires)
0.0