[Hamuth]

hi

Does any one have a coding example that resolve problems like:

1. a text file containing 5 paprgraphs not more than 100 words, the name of text file is "abstract.text"

2. write java code to determine how many of the paragraphs are below 90 words?

3. what is the average word length in all abstracts?

4. given a word, determine how many times this word is used in all the paragraphs.

this program should be extended further(inheritance)

to

given a paragraph e.g paragraph3, the program should list all the sentenses which have more than 10 words. these sentenes should appear one line and in aplhabetical order.


Does anyone of u have a java coding that resemble the requirements given above?

thank u.

[fjf314]

I don't think you're going to find an example with that many specifics in it. From what you've given, it seems pretty straightforward. The functions of the StringTokenizer class can handle a lot of those with ease. You can check them all out here:

http://java.sun.com/j2se/1.5.0/docs/api/

If you have any questions, you would be better off posting exactly what you're confused about rather than just typing out the whole sheet your professor gave you. I'm not trying to be rude, but between this thread and your "Dynamic Barchart" thread, it basically seems like you want people to give you examples that do exactly what you're supposed to be coding and I don't think it's likely anyone is going to do that. If you need help with something, feel free to ask questions, but don't expect to get your whole assignment just handed to you.

[jaeusm]

Does anyone of u have a java coding that resemble the requirements given above?

Do your own homework.

[Hamuth]

Ok i'll work it out.

I knew it wasnt good to ask like that but ive just tried!!

For anyone who read my 2 posting i'am sorry please!!.

i'll be more problem oriented next time!!

thanks
wassim