CMSC-341 Fall 2001
Project 3 Notes and Corrections
- 21 October 2001
The BinarySearchTreeItr class was initially implemented using the
default assignment operator and copy constructor. That was causing core
dumps for some people. These routines have now been implemented
correctly. If you're struggling with an odd core dump, recompile and try
it again.
- 18 October 2001
If a LOAD command fails because the file cannot be opened, you can exit
the program at that point, thereby ignoring the remainder of the command
file.
- 16 October 2001
You are not required to use Weiss' implementation of the string class.
You can implement your own or use the STL version.
- 11 October 2001
The project description asks you to make CONST some data members in the
classes that you define. It also asks you to write a copy constructor for
those classes. It is not possible to have both, so no data members should
be CONST and you should write a copy constructor.
- 11 October 2001
The project description asks you to write the "Big 4" for the author's
classes if he did not do so. That is no longer required. You do not need
to modify or submit any of the binary search tree or binary heap files.
- 11 October 2001
The project asks you to use a min-heap to identify the M most frequent
words in a document containing N unique words. The min-heap should NEVER
contain more than M elements. Also, the complexity of the routine that
identifies the most frequent words should run in O(N + M log(M)) best case
time (not average case as stated in the project description) and O(N M
log(M)) worst case time.
- 11 October 2001
There is now sample output available in the following directory:
/afs/umbc.edu/users/d/e/dennis/pub/CMSC341/Proj3
The output file 341-Fall01-p3-sample_output.txt was created by running
on the command file 341-Fall01-p3-sample_commands.txt which loads the data
files p1.txt, p2.txt and p3.txt. The data files are the descriptions of
the first three projects taken from the course web page.