Back to 211 Main Page

Mobius strip

Assignment 5

The Assignment

http://www2.hawaii.edu/~tp_200/ics211/fall2003/A5-dictionary.htm

Current Status

The graphical display of the tree will not be released. But I've made it extra credit if you want to implement it. See below for details.

Comments

You can get all the files you need here.

You should read this overview of the files and the assignment. This page also includes a FAQ section that I will update as I get questions.

When you submit your assignment, tell me which browser worked for you. By default, I will use appletviewer for Java 1.2.2. You can use this java version-checking applet to find out what Java Runtime Environment your current browser is using.

Grading

This assignment will be out of 10 points. You will get points for the following:

2.0 - Compiles
Your submitted program compiles and runs without error
1.0 - Complete submission
In your email, include a full link (http://...) to a working version of the applet on the web. Attach your source code (.java files). (You can zip them if you really want to.)
1.5 - Good documentation
See this note on documenting your code.
0.5 - Follows ICS coding standards
Use descriptive variable names, use internal capitalization for names, consistently indent and space code, etc.
0.5 - DictionaryEntry
toString and compareTo methods implemented correctly.
5.0 - BST Implementation
BinarySearchTree works correctly:
  • 0.5 - isEmpty, size, removeAll
  • 0.5 - retrieve
  • 1.0 - toString
  • 1.0 - insert
  • 2.0 - remove
0.5 - Applet interface
Includes at least the following capabilities:
  • adds a dictionary entry to the tree
  • removes an entry from the tree
  • clears the tree
  • displays the tree in textual, list form. (Graphical, tree form is optional.)
  • unusable buttons are disabled and errors are reported when they occur

Extra credit

Since I never got the graphical display of the tree out to you, I'm allowing you to write it yourself for extra credit. The max you can earn is 2.0.

0.5 / 2.0 points
Graphically displays a tree of any size, but does not display the contents of the nodes.
A tree displaying nodes only.
1.0 / 2.0 points
As above, but the panel is scrollable somehow so that the entire tree can be seen, no matter how large the tree grows.
1.5 / 2.0 points
As above, but the tree shows the contents of each node.
A tree of dictionary entries.
2.0 / 2.0
As above, but it is possible to select (while using the applet) whether the tree displays the nodes only or the contents of the nodes.


~ztomasze Index : TA Details: ICS211: Assignment 5
http://www2.hawaii.edu/~ztomasze
Last Edited: 03 Dec 2003
©2002 by Z. Tomaszewski.