Subject: 326: Important Freq Question
From: James Nicholas Deibel (jdeibel@cs.washington.edu)
Date: Wed May 15 2002 - 17:10:09 PDT
> In the sample code there is mention of us doing this with a BST, yet the
> website doesn't say anything (or at least I didn't see it . . .I've been
> blind before). So whats the word, BST or no?
This is a good question. To clarify, the website says:
You should implement at least an AVL tree, a separately chained hash
table, and an open addressed hash table with linear probing.
but it also says:
your program must take the following flags. The sample code has an
example of an easy way to parse flags.
-t, -a: use a BST or an AVL tree, respectively. How you produce
the sorted output is up to you (and an excellent topic
for your README).
Now, that's absolutely clear, right?
My apologies for this confusing homework description. Ideally, that
inconsistency should have been caught beforehand. Here is the expected
requirements for the Frequency Project:
- a BST tree
- an AVL tree
- a separately chained hash table
- an open addressed hash table with linear probing
The webpage for the homework is now updated.
The BST should not take much additional work to add into the project. If
there are problems with this, please contact both Matt and I.
nick deibel
This archive was generated by hypermail 2b25 : Wed May 15 2002 - 17:10:18 PDT