assignments

Seven

due Thursday March 31

Six

due Thursday March 10

Five

due Thursday March 3

Four

due Thursday Febuary 17

As discussed in class on the 10th, each of you is taking a different version of a binary-tree-like algorithm to examine, implement (with help from any sources you can muster), test, and explain. If I'm remembering right, the breakdown looks like this: We agreed that we'd use data like that in /usr/share/dict/words as the string objects for populating the trees, and that we'd all have an API something like the following. We left as unspecified whether the FIRST and NEXT needed to traverse the data in order.
 ADD("string");
 DELETE("string");
 boolean = SEARCH("string");   # return the node, perhaps?
 "string" = FIRST();
 "string" = NEXT();

Three

due Thursday Febuary 10

Two

due Thursday Febuary 3

One

due Thursday January 27

<%doc> $Id: assignments.html 254 2005-02-28 17:48:44Z mahoney $