Exams

Exam Policies

Final

Stats:

total
MEDIAN 74
AVG 72.2
STDEV 11.63

Regrades:

The final exam follows the same regrade policy as the midterm exam (see below). A cover sheet and a printout of your code and sample output is required for a final exam regrade. You can slide your final under Jessica Miller's office door (CSE 214) with the proper cover sheets attached. Regrades will be accepted through June 27, 2011.

Time/Place:

  • Date: Tuesday, June 7, 2011
  • Time: 2:30p - 4:20p
  • Place: MGH 241

Practice Problems and Exams (with answer keys):

The practice problems posted here are intended to give you practice with the topics we have covered since the midterm. We do not promise that the final will cover exactly the same topics as the practice problems, but it will all come from material we have covered.

If you would like more practice, you might want to take a look at Autumn 2010's final study guide as there are many other practice exams from previous quarters hosted there.

Structure and Topics:

The final will be a comprehensive final. In general, all of the major topics we covered in lecture are considered "fair game" on the exam. That said, there will be an emphasis on the material we have covered since the midterm (roughly 1/3 pre-midterm material and 2/3 post-midterm material. There will be both conceptual and programming questions.

The following topics are guaranteed NOT to be tested on the final in any form:

  • generics
  • recurrence relations
  • shell sort
  • external sorting
  • deletion from B-Trees

Midterm

Scores:

You can now view your midterm scores on MyUW. Your midterm exam will be returned back to you after Monday's lecture.

The average score was 80.95% with a standard deviation of 12.85 points. There will not be a curve on the midterm exam.

Regrade Policy:

If your exam score was added up incorrectly, take it to one of the TAs and they'll fix it for you.

If you disagree with the grading, such as if you think your solution actually does work, or that your solution is more nearly correct than it was given credit for, the procedure for regrades is the following:

  • If your complaint is about the correctness of your solution to a programming question (#5), download the IntBinaryHeap.java file from the lectures page, add your method to the class in Eclipse, fix any trivial syntax problems, and then run it for yourself and see how nearly correct your solution is.
  • If you still think your grade is incorrect, submit your exam to the instructor for a regrade. (Either give it to us in lecture, go to our office hours, or slide it under our office doors.) You must include a cover page with a brief written explanation of what specifically you think was misgraded and why. If your complaint is about overly harsh grading on a programming question, you should also submit a printout of your code being run with your own test case results so that we can to verify its correctness. We will not accept any exam for a regrade unless it includes this cover page, and we will not re-evaluate grading of the correctess of any programming questions without a typed copy of your solution from Eclipse being shown to us first.
  • Also note: When you submit an exam for a regrade, we will regrade your entire exam. If we notice anywhere that you were mistakenly given too many points, we will also correct this, up to a maximum penalty of -2 for the entire exam. So it is possible (though unlikely) that a regrade request will result in you receiving a slightly lower mark than what you started with.
  • All midterm regrade requests (other than simple score addition errors) must be submitted by Monday, May 23, 2011.

Time/Place:

  • Date: Friday, May 6, 2011
  • Time: in lecture, 50 minutes
  • Place: in normal lecture room, MGH 241

Practice Exams (with answer keys):

The sample midterm exam posted here is intended to be similar to the midterm. The number of problems and type of problems on the actual exam will be like what is seen on this practice exam. We do not promise that the midterm will cover exactly the same topics as the practice exam, but it will all come from material we have covered.

If you would like more practice, you might want to take a look at last quarter's practice exam and answer key.

Topics:

In general, all of the major topics we covered in lecture are considered "fair game" on the exam.

The following topics are guaranteed NOT to be tested on the midterm in any form:

  • generics
  • recurrence relations
  • shell sort
  • external sorting
  • hashing