CSE 250 - Fall 2008
Project 1 Grading
*******************

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] Read in a file (4 points or 0 points)
	Program prompts the user for input about the name of the file to
	read in.
	
[B] Max heaps (16 points or 8 points or 0 points)
	Program is required to store the information about the words 
	and frequencies and characters and frequencies in two separate 
	max heaps.  The points for this section are awarded only for the
	max heaps being present and populated since I did not clearly
	specify what the max heaps should be used for in the program.
	Award 8 points for each of the max heaps existing and being
	populated for a total of 16 points.  If the heaps are not
	present in the program, award 0 points.
	
[C] Print out words by decreasing frequency (0, 3, 4, 7, 11 points)
	(1) There should be an option available to the user to print out
	the words in decreasing frequency.  Award 3 points for this, or none
	if not present.
	
	(2) 8 points are awarded for the program actually doing the ordering
	and the printing of the words correctly.  Four points can be awarded
	if the words are not printed out correctly.

[D] Print out characters by decreasing frequency (0, 3, 6, 9, 15 points)
	(1) There should be an option available to the user to print out
	the characters in the file by decreasing frequency.  Award 3 points for
	this, or none if not present.
	
	(2) 12 points are awarded for the program actually doing the ordering
	and printing of the characters correctly.  Award only 6 points if 
	characters are duplicated or if ordering is not correct.

[E] Print out Huffman codes for words (0, 3, 8, 11, 19 points)
	(1) There should be an option available to the user to print out the
	Huffman codes for the words of the file.  Award 3 points for this, or 
	none if option is not present.
	
	(2) 16 points are awarded for the program actually doing the ordering
	and printing of the Huffman codes.  If the codes are not correct, award
	only 8 points.  Check to ensure that a Huffman tree algorithm is implemented
	in the code.  If it is not, max grade is 8 points for this part.
	
[E] Print out Huffman codes for characters (0, 3, 8, 11, 19 points)
	(1) There should be an option available to the user to print out the
	Huffman codes for the characters of the file.  Award 3 points for this, or 
	none if option is not present.
	
	(2) 16 points are awarded for the program actually doing the ordering
	and printing of the Huffman codes.  If the codes are not correct, award
	only 8 points.  Check to ensure that a Huffman tree algorithm is implemented
	in the code.  If it is not, max grade is 8 points for this part.

[F] Analysis (0, 3, 4, 7, 8, 12, 15 points)
	(1) There should be an option available to the user to print out the
	analysis of the file sizes in ASCII, Huffman words, and Huffman characters.
	Award 3 points for this, or none if option is not present.
	
	(2) ASCII value computed correctly.  I told the students to assume 7 bits
	for ASCII, but if they used some other constant value, that is fine as 
	well.  Award 4 points - no partial.
	
	(3) Huffman size based on word encoding computed correctly.  Award 4 
	points - no partial.
	
	(4) Huffman size based on character encoding computed correctly. Award 4
	points - no partial.

[G] Deductions - These deductions should be assessed if the student fails
to include a required part of the project.

	(1) testing.txt file (-30 points if the file is not present, -10 points
	    if the file is not sufficiently large enough for a project of this
		size)
	(2) README file (-10 points if the file is not present)
	(3) makefile (-10 points if the file is not present)