In all cases, the project should result in an applet that can be run in both I.E. and Mozilla. The applet should follow the style of the other applets assigned in this class. In the case of the web spider, there may be a non-applet component of the project that crawls the web.
a. Web spider and search engine (One student builds the spider and the other does the query processor) This program is the one exception to the applet rule. The spider should run as an application program, ideally on the server. The query processor can run as an applet, but it must then download the web index from the server, possibly as a precompiled object. b. Graph Layout One student handles the algorithm, and the other handles the input formats, graphics, and interaction. This program should produce nice layouts with relatively few crossovers in the case of nonplanar graphs. c. Graph shortest path finding with Dijkstra's algorithm. (Applet). Use a simple layout method, or allow the user to enter the layout info as part of the input text. d. Image segmentation using Disjoint sets...
Disjoint sets implementation without application to image segmentation. Knuth-Morris-Pratt string matching algorithm. B-Trees applet demo supporting insert and delete as well as find and inorder traversal. Splay trees applet demo.The project proposal form handed out in class contains a draft schedule for your work on the project. You are welcome to set your own schedule, except for the June 4 demo deadline. Project reports will be due on Monday, June 7 at 5:00 PM.
The source files and the project report file should be turned in as a ZIPped archive with a filename based on your last name (for a partnership, both partners' last names. For example, JONES-MILLER-373-PROJ.ZIP).