cs2223, D97/98
Grading of Exam 2 - 100 points total

Question 1 (30 points total)
 	10 for proof methods - understanding what is required for a proof
 		including a proof method, definitions, axioms, domain, etc.
 		5 for some understanding of proof methods
 		10 for excellent understanding of proof methods
 	10 for the proof of Q1.1
 		10 for a completely correct proof (consistent with proof methods given)
 		5 for a mostly correct proof or an interesting disproof
 		0 for nothing or for a demonstration that it is true for some number
 	10 for the proof of Q1.2
 		10 for a completely correct proof (consistent with proof methods given)
 		5 for a mostly correct proof or an interesting disproof
 		0 for nothing or for a demonstration that it is true for some number
 		
Question 2 (30 points total)
 	10 for understanding differences between heap and BST
 		5 for implicit understanding or for one of two properties
 			(L/R ordering, not necessarily "almost complete")
 		10 for complete understanding of both properties
 	15 for an implementation of the L/R swap to establish the BST relationship
 		5 for understanding that the swap is required
 		10 for some implementation of the swap
 		15 for a correct or mostly-correct implementation (reasonable code)
 	5 for sifting after the swap (code or mention)

Question 3 (40 points total)
	priority
	15 for understanding how to set the priorities in the queue
		5 for understanding that priorities are an issue
		10 for a reasonably good method for setting printing priorities
		15 for a method which would work
	15 for the algorithm
		5 for the sorting to match the priorities set above
		5 for handling the case of multiple jobs with the same duration
		5 for avoiding overlaps
	10 for the answer for the specific case
		5 for a mostly correct answer
		10 for a completely correct answer (no overlap, 5 jobs printed)