Project 2 Grade Report for _________
Project 2

Spell Checker 

with AVL Tree Abstract Data Type using Templates

 

Program compiles and runs:

2 Points:  Compiles without errors and runs without deadlocks or crashes, as a Visual C++ default workspace. 

 

Program fulfills all requirements:

3 Points:  Your program implements a tree abstract data type, as specified, possibly except for height balancing.  Your tree abstract data type must be similar in implementation to the Standard Template Library data types.

2 Points:  Your program's tree abstract data type is an AVL Height Balanced Tree.

3 Points:  Your program reads from the WordList dictionary file and creates an internal tree of all the words in the dictionary using your tree abstract data type. 

3 Points: Your program prints the first 25 words in the list in both pre-order and post-order, using your PreorderIterator and PostorderIterator classes.  The printing must be identical both to the screen and to an output file called Results.txt. 

4 Points: Your program gets a name of a file from the user, reads in the file, and prints each word, along with its line, not found in the dictionary.  The printing must be identical both to the screen and to an output file called Results.txt. 

 

Good Object Oriented Design:

1 Points:  The program has a reasonably small, logically simple void main() that then creates and uses appropriate, well designed classes to do the work.

 

Coding Style (2 points if all of the below are fulfilled)

2 Points: Data in proper places on the disk. Good indentation. Good C++ code style, including proper capitalization. Well commented.

 

                                                   Interactive Grade (20 points total) _______________
 

                                                                                            Final Grade _______________
 
badman.jpg (2629 bytes) Office:  M233a Phone:  353-2250 sbadman@parkland.edu