This preview shows page 1. Sign up to view the full content.
Unformatted text preview: description of function, description of variables, description of while-loops, indentation, etc 15 Written Report Discusses choice of algorithms and data structures Includes drawing of class structure and design Discussion of results Satisfactory conclusion on comparison of 1000 word rankings Satisfactory conclusion on average rankings of 200 common words Satisfactory conclusion on the comparison counts and CPU times Machine used Steps to ensure correctness and testing Overall presentation of report Sections clearly marked, outlay, no typos,) All output organized and structured for easy reading 35 5 5 10 5 10 Appendix A, B, and C Parser class submitted on Mar. 11 3 Late Policy (-10% late for each 24 hours) Extra Credit (5% for sub-classing binary search tree class) Maximum 25 points for programs that fail to compile Electronically submitted the .h files, .cpp files, solution files? Programs are checked for plagiarism...
View Full Document
This note was uploaded on 05/04/2008 for the course CS 352 taught by Professor Mullins during the Winter '07 term at University of Missouri-Kansas City .
- Winter '07