Exam Regrade Policy

You may request to have your exam regraded, but when you do so, you are submitting it for a complete regrade. Your score can go down as a result. For example, you might get points back on one exam question only to find that you should have lost points on some other exam question.

Exams are graded collectively by the course staff, so individual TAs have little power to deal with exam grading issues. Please submit regrades by the following dates.

• Midterm regrade requests must be submitted by Monday, November 18 at 11:30 pm. Regrades cannot be submited before Tuesday November 12th at 8:00 am.
• Final regrade requests must be submitted by Friday, January 10th (first Friday of Winter quarter) at 11:00 pm. Regrades cannot be submitted before Monday, December 16th at 8am. Regrades will not be processed until after the deadline so you will not receive an email with the result of the regrade until the second week of Winter quarter.

To check if your solution is correct, we have provide some testing programs:

• Midterm:
  • Test3.java
  • Test6.java
• Final:
  1. Binary Tree Traversal: No testing program
  2. Binary Search Tree: No testing program
  3. Inheritance/Polymorphism: No testing program
  4. Comparable MovieRating.java and TestQ4.java
  5. Collections TestQ5.java
  6. Binary Tree Programming I TestQ6.java
     • Note: Since this program is random, this can only give you an approximate idea whether or not it is correct
  7. Binary Tree Programming II TestQ7.java
  8. LinkedIntList TestQ8.java

If you believe a problem was incorrectly graded, you must:

• Submit a regrade request using this Google Form. The form has a series of questions asking which problems you want graded. Please follow the directions at the beginning of the form very carefully. Regrade requests that do not follow the directions will be denied.
• If you think there was an issue with the scan of your exam, indicate so in the regrade request and Hunter will check back to the original paper exam.
• Specific rules for specific problems on the exam
  • On the midterm, if you can find one line in the Stacks & Queues problem that can be added/removed/changed to make your solution correct, include that information in the request. Hunter will charge 5 points for a single-line addition or subtraction. (That is, on a 25 point problem, your score is capped at 20/25)
  • On the midterm, if you can one .next in the ListNode problem that can be added/removed to make your solution correct, include that information in the request. Hunter will charge 1 point for a single addition/removal of a .next.
  • On the final, if you can find one line in the LinkedIntList problem that can be added/removed/changed to make your solution correct, include that information in the request. Hunter will charge 5 points for a single-line addition, subtraction, or change. (That is, on a 20 point problem, your score is capped at 15/20)