| Project 2 Grading Criteria |
1 Point:
The project compiles and runs, even though possibly incomplete.
1 Point: The
two data structure classes' public interfaces are identical.
2 Points: The
two data structure classes' store all the words in a proper internal structure
keeping a count of all duplicates.
2 Points: The
two data structure classes' retrieve a word from the user from the internal
structure and report the count for that word.
1 Point: The
binary tree program walks the tree and prints all the words
and word counts in alphabetical order.
1 Point: The
program does all of the required interaction with the user,
either using the supplied code, or code that produces a substantially similar
result.
2 Points: The
linked list Abstract Data Type internally implements a linked
list non-recursively, manipulating pointers according to accepted linked list
implementation.
2 Points: The
binary tree Abstract Data Type internally implements a binary
tree non-recursively, manipulating pointers according to accepted binary tree
implementation.
2 Points:
The
data structure
classes' Constructors properly initialize all variables.
2 Points: All data
in your class is contained in private variables.
2 Points: The
Abstract Data Type uses well designed methods that cannot be
crashed and cannot corrupt the instance variables (the primes array).
1 Points: Uses a .cpp and .h file
for each of your Abstract Data Types, and separate .cpp files for your int main()
and any other classes.
Coding Style ( 1 point for all of the following):
Good indentation.
Good
C++ code style.
Well commented.
Interactive grade: (20 points total) _______________
Final Grade _______________
| Back to Project 2 |
| Csc 125 - Computer Science II, Programming in C++, Fall 2006 |
| Scott Badman Office: B132 Phone: 353-2250 sbadman@parkland.edu |
Parkland College, 2400 W. Bradley Avenue, Champaign, IL 61821 |