- Assignment 1
- Complete a program that finds the best route between two cities.
(includes a proof of the algorithm used)
- Assignment 2
- Create modules implementing city-graphs and city-stacks.
- Assignment 3
- Write a grep-like program that (optionally) searches recursively
through subdirectories. (includes an normal version, an
obfusticated version and a literate version (which was submitted))