From main@boulder.Colorado.EDU Tue Apr  6 14:29:28 1999
Date: Tue, 6 Apr 1999 14:24:02 -0600 (MDT)
From: Michael Main <main@boulder.Colorado.EDU>
To: cs-moose@cs.colorado.edu
Subject: Final Programming Assignment

On the slate for April:
-- Finish the fractal if you haven't already done so
-- Finish the CGI program if you haven't already done so
-- Finish the b-tree assignment (below)
-- We'll have one more recitation exam and also a final exam in the lab.

B-tree programming assignment:

Implement a dictionary class that allows a programmer to store a bunch
of strings along with a key for each string. The keys will be long
integers and the strings will be null-terminated with up to 42
characters. For example, the keys might be social security numbers and the
strings could be a person's name.

The dictionary should use a b-tree to store its information.
This should be an external b-tree (the nodes are stored in a file).
The nodes of the b-tree should use the NodeFile class that you
can grab from ~main2270/programs/nodefile.h and nodefile.cxx in
the undergrad lab. There's also a small test program called testnf.cxx.

You'll have to turn in the class that you implement and also an
interactive test program that shows that you have tested your Dictionary
class. This should be a fun assignment (really).

--Michael