[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]


    Search the Q&A Archives


...calculate frequency of each word in a text file.

<< Back to: comp.lang.c Answers to Frequently Asked Questions (FAQ List)

Question by vishal
Submitted on 7/31/2003
Related FAQ: comp.lang.c Answers to Frequently Asked Questions (FAQ List)
Rating: Rate this question: Vote
how to calculate frequency of each word in a text file.


Answer by Manju
Submitted on 8/11/2003
Rating:  Rate this answer: Vote
Please refer Kernigan Ritchie, it is solved in that book

 

Answer by tt
Submitted on 3/3/2005
Rating: Not yet rated Rate this answer: Vote
hey

 

Answer by sahim
Submitted on 4/10/2005
Rating: Not yet rated Rate this answer: Vote
depends upon the BW and latency u can calculate and remember one sample equals twice the highest frequency

 

Your answer will be published for anyone to see and rate.  Your answer will not be displayed immediately.  If you'd like to get expert points and benefit from positive ratings, please create a new account or login into an existing account below.


Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer:

FAQS.ORG reserves the right to edit your answer as to improve its clarity.  By submitting your answer you authorize FAQS.ORG to publish your answer on the WWW without any restrictions. You agree to hold harmless and indemnify FAQS.ORG against any claims, costs, or damages resulting from publishing your answer.

 

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

 

<< Back to: comp.lang.c Answers to Frequently Asked Questions (FAQ List)


[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]

© 2008 FAQS.ORG. All rights reserved.