CSC365 Assignment 2

• Your program acts as a server daemon, continually waiting for clients connecting at port 2688. The file SimpleService.java shows basic structure. (Please run this on workstations, not on rocky. Also remember to kill this program when you are not logged in!)
• Client requests and server responses both use HTTP protocol. See IETF HTTP RFC 1945. The service doesn't really support full HTTP though. Instead it treats each "GET" as a lookup request to check a word. For example, "GET /pickle" is a request for check spelling of "pickle".
• If a requested word is not known, then it is added, so the next request for the same word will say that it is spelled correctly. (This is a stripped-down version of a mechanism for adding new words to the dictionary.)
• The response page can be html-formatted in any way you like.

This assignment must be done in two phases:

1. In the first phase, you will implement the dictionary as an internal order-8 B-Tree initialized from http://gee.cs.oswego.edu/dl/csc365/words, which contains one word per line.
2. In phase two, you must use a persistent B-Tree. You cannot proceed to phase two until you successfully demo phase1.

Test your program thoroughly before demonstrating and submitting.