See the assignment turn-in page (last modified on 3 September 2003) for instructions on turning in your assignment.
mitm() to output to std-out a count of
the number of times each word appears in the given document. Each line of
output should appear as
cnt word
cnt should be left-justified in the line. Lines should be output in order of increasing count; the final lines of output should contain the most frequently occurring words. Each word should be output exactly once. Letter case should be ignored when comparing words for equality.
The framework code for this assignment as been rewritten from what it was in
the previous assignment. Make sure you use the contents of the
/export/home/class/cs-305/pa3b assignment directory for this assignment.
As always, it is not necessary that you understand these files to do your assignment. You may do whatever you want with these files to help you implement and test your assignment, but your code should not rely on any modifications you make to these files. These files are deleted if you submit them, and your code is compiled with the code from the assignment directory.
You may add whatever other files you feel are necessary to implement this assignment.
You may not use STL components (containers and algorithms) for this assignment; STL components will be disabled for this assignment.
This page last modified on 17 October 2003.