CSE 250 - Fall 2008
Project 3 Grading
*******************
/////
//NOTES:
// There are two parts to this project, the first part is to be handed in 
// in hard copy and worked on in a group of 3-4 people.  
//
// The second part is a programming project that can be worked on 
// individually or in a group of at most two.  This group can be totally
// different from the group for part one.
//
// If you hand in the programming part as a pair, both members of the pair
// will get the same grade on part two.  Grades are individual for part one.
/////


PART ONE (Code critique)
========================

[A] Attendance (15 points)
	Attendance for week of 11/10 (5 or 0 points)
	Attendance for week of 11/17 (5 or 0 points)
	Attendance for week of 12/1  (5 or 0 points)
	
	Note:  If participation of group in activity was not satisfactory, 
		   all attendance points will be lost.  Satisfactory participation
		   judged by TA in recitation.

[B] Your critiques of group members Code (5 or 0 points)
	You have given your hard copy of other group member's code 
	critiques to them so that they can turn them in with their report
	
[C] Writeup (30 points - 5, 2, or 0 points for each topic listed)
	Two good points about your code
	One bad point you knew about
	One bad point you iddn't know about
	Two best suggestions for improving your code
	Overall impression/what did you learn
	
	Group member critique - good or bad
	Note:  From the critique a deduction or addition can be made
	       to your overall grade from part one.


PART TWO (Programming project - if working alone)
=================================================
Automatic grade of 0 assigned if:

(1) Your program does not compile using your makefile.
(2) Your program does not run.
(3) If the TA who is grading your program is not able to figure out 
    how it works [fixable, but you must meet with her in person]


[A] Deductions - These deductions should be assessed if the student fails
to include a required part of the project.
	(1) README file (-15 points if the file is not present)
	(2) makefile (-15 points if the file is not present)
	

[B] Reading in file to create Huffman tree (6 points)
	Code parses file into hash table for word/frequency counts (3, 1, 0 points)
	Code generates appropriate Huffman tree for file (3, 1, 0 points)

[C] Generation of encoded Huffman tree file (16 points)
	Huffman tree used to generate encodings for words (8, 4, 0 points) 
	Original file encoded using tree (8, 4, 0 points)
	
[D] User Interface / Reporting (15 points)
	Report words with highest frequency (2 or 0 points)
	Report words with lowest frequency (2 or 0 points)
	Report if a word was in the file (1 or 0 points)
	Report on the average frequency of words in a file (2 or 0 points)
	Report the number of collisions occurred when creating hash table (3 or 0)
	
	User interface was easy to use (5, 2, or 0 points)
	
[E] Testing (13 points)
	A file named testing.txt is included in the submission (3 or 0 points)
	
	This file contains information about the type of test files used as 
	input and how the program performed on those files (3, 1, 0, points)
	
	There should be a number of tests run on files of different sizes with
	different configurations of characters (3, 1, 0 points)
	
	The file shows evidence that a test plan was created and testing was 
	done as part of the process of developing this solution (4, 2, 0 points)

/////////////////////////////////////////////////////////////////////////////
PART TWO (Programming project - if working as a pair)
=====================================================
Automatic grade of 0 assigned if:

(1) Your program does not compile using your makefile.
(2) Your program does not run.
(3) If the TA who is grading your program is not able to figure out 
    how it works [fixable, but you must meet with her in person]


[A] Deductions - These deductions should be assessed if the student fails
to include a required part of the project.
	(1) README file (-15 points if the file is not present)
	(2) makefile (-15 points if the file is not present)
	

[B] Reading in file to create Huffman tree (10 points)
	Code parses file into hash table for word/frequency counts (2, 1, 0 points)
	Character/frequency counts also created (2, 1, 0 points)
	Code generates appropriate Huffman tree for file (2, 1, 0 points)
	Code parses a significant sized file (2 points)
	Parsing does not ignore white space and punctuation (2 points)

[C] Generation of encoded Huffman tree file (8 points)
	Huffman tree used to generate encodings for words (8, 4, 0 points) 
	Original file encoded using tree (8, 4, 0 points)

[D] Decoding of a Huffman endcoded file (8 points)
	Word/encoding pairs able to be sent/accessed for decoding (8, 4, 0 points)
	Decoding of file produced (8, 4, 0 points)
	
[D] User Interface / Reporting (15 points)
	Report words with highest frequency (2 or 0 points)
	Report words with lowest frequency (2 or 0 points)
	Report if a word was in the file (1 or 0 points)
	Report on the average frequency of words in a file (2 or 0 points)
	Report the number of collisions occurred when creating hash table (3 or 0)
	
	User interface was easy to use (5, 2, or 0 points)
	
[E] Testing (9 points)
	A file named testing.txt is included in the submission (2 or 0 points)
	
	This file contains information about the type of test files used as 
	input and how the program performed on those files (2, 1, 0, points)
	
	There should be a number of tests run on files of different sizes with
	different configurations of characters (2, 1, 0 points)
	
	The file shows evidence that a test plan was created and testing was 
	done as part of the process of developing this solution (3, 1, 0 points)
	
///////////////////////////////////////////////////////////////////////////////