Homework 2 Grading Guide

1. 20 points: You will need to manually check the student's source code for parts a-c. You can check part d by running it with an input file. For parts a-c, just check quickly to make sure that the student did what I asked of them. You don't need to check the quality of the code.
   1. part a (4 points)
   2. parts b: 4 points
   3. 12 points: The program runs correctly, which means it produces the correct output and that it accepts input from stdin

2. 80 points Look for the following elements:
   1. 80 points: A correct solution is found to the puzzle or no solution is found if the puzzle is unsolvable.
   2. Deductions:
      1. Quickly scan their code and make sure that they:
         1. Used maps rather than linked lists for storing node names (-10)
         2. A stack (as discussed in lecture it's best to use an ArrayDeque to implement a stack) for keeping track of the solution (-5)
         3. Did not hard code the maximum number of pets (-10)
      2. Deduct 3 points if the student's executable takes signifantly longer than mine on ta_puzzle3. I've attached my solution so that you can time it on your machine with ta_puzzle3. I would deduct 3 points if the student's solution takes 3 times longer than mine.