11 / 10 / 99 - The final exam will be held on Wednesday, 12/8/99, from 1:00 - 3:00 pm, in LC-F4
11 / 10 / 99 - Extra Credit for MP 5 (worth 15 points)
First you must make sure the graph does NOT contain a cycle. If it does contain a cycle, print an error message and do NOT compute the topologocal sort. Otherwise, print out the vertices sorted by the topological sort.
10 / 7 / 99 - You might want to see this nice AVL tree applet. It makes it easier to visualize how the functions work.
Here is another AVL Tree applet. It does not show the values in the nodes like the previous applet, but it does deletion in the manner desired by our assignment.
Submit using the Unix command : turnin -c eecs360a -p mp1 <source files>
Don't forget to specify the compiler used in your source comments
Link to spelltest.c
Link to spellword
Link to g++ tips!
Link to wordlist for MP 4. More words may be added to this file (or another file may get created).
Link to biglist for all of the words of 5 letter or less from /usr/dict/words.
|For additional information, call, write or email:
The University of Illinois at Chicago
ph: 312/996-3422, firstname.lastname@example.org