Name: ______________________

Interactive Word Indexer

Program fulfills all requirements:

2 Point:   The project compiles and runs, even though possibly incomplete.
4 Points: Implements a Binary Tree, and stores all the words from the file without duplicates.  
4 Points: Uses an appropriate (non-array) data structure to store references to full lines in dynamic memory.
2 Points: Uses dynamic memory for all storage except for small local variables within functions.  No arrays.
4 Points: Implements an AVL tree.

Program design:

4 Points: The project's functional design is logical and appropriate according to good top-down design practice, or the object oriented design follows standard object oriented practice.  If object oriented, the classes are implemented using proper Data Encapsulation and protection.  int main() is short and represents the entire logic of the program through appropriate function calls.

Coding Style (2 point if all of the following are satisfactory):

Good indentation.
Good C code style.
Uses a .c or .cpp and .h files according to standard C or C++ practice:  
Well commented.

                                                          Interactive Grade (22 points total) _______________
 

                                                                                                Final Grade _______________
 

Back to Project 1

Csc 220 - Data Structures, Fall 2006

Scott Badman   Office: B132   Phone: 353-2250   sbadman@parkland.edu

Parkland College, 2400 W. Bradley Avenue, Champaign, IL 61821