Exams

Midterm Exam

Results:

You can now check your midterm score on MyUW (see instructions). Your exam was returned to you in section on Tuesday. Please wait to receive your exam before asking grading questions.

Shift: The score listed on MyUW is your raw score. There will be a +12 point shift added to everyone's score. However, the maximum possible midterm score is 100. So, for example, if you got 99 on the exam, your score maxes out at 100, not 111.

Stats:

stat raw adjusted
MEDIAN 66.5 78.5
AVG 64.9 76.9
question average raw score
Q1 (Recursive tracing) 9.2 / 10
Q2 (Recursive programming) 7.9 / 15
Q3 (Collections mystery) 6.8 / 10
Q4 (Collections programming) 9.9 / 15
Q5 (Linked nodes) 10.6 / 15
Q6 (Stacks and queues) 17.1 / 25
Q7 (ArrayIntList programming) 3.5 / 15

Low Grades: some students ask about how much effect a lower midterm score will that have on their grade, or what are their options, etc.? Most of the information to answer this can be found on this web site. The course syllabus lists the relative grading weight of homework vs. midterm vs. final exam, so you can use that to compute the rough effect on your grade of a particular midterm score. You may want to use our new Grade-a-nator page to help you compute your approximate grade. Also look at our FAQ page for info about S/NS grading options, drop dates, and other information.

Regrades:

If your exam score was simply added up incorrectly, take it to your TA and they'll fix it for you.

If you believe that one or more programming problem was incorrectly graded and you would like Melissa to regrade it, you must:

  • Type in the problem(s) to the appropriate test file below exactly as it appears on your exam.
  • Print out the output of running the test.
  • Write a brief cover page describing what problem(s) you would like regraded and why.
  • Give Melissa your original midterm, your test results, and your cover page either in person or slide it under her door in CSE216.
  • All regrade requests must be received by Monday, August 12th.
  • Melissa will regrade your entire exam meaning that your exam score may go down as a result of a regrade request.

Time/Place:

  • Date: Monday, July 29, 2013
  • Time: 60 minutes
  • Place: in normal lecture room (EEB 105)
  • Cheat sheet (will be stapled to your exam)

Practice Exams:

The actual midterm exam will have 6-8 total problems. Those problems will be selected from the following kinds of questions:

  • ArrayList "mystery" (look at a piece of code that uses ArrayLists, and write its output -- video)
  • ArrayList programming (write a method that uses ArrayLists)
  • ArrayIntList programming (add a method to the ArrayIntList class from lecture)
  • Collection "mystery" (look at a piece of code that uses Java collections such as Lists, Sets, and Maps)
  • Collection programming (write a method that uses Java collections such as Lists, Sets, and Maps)
  • stack and queue programming (write a method that uses Stacks and Queues)
  • linked list node manipulation (write a few lines of code to change a "before" picture of some linked nodes into an "after" picture -- video)
  • recursion tracing (look at a piece of recursive code, and write its output)
  • recursion programming (write a method that uses recursion)
  • The following topics are guaranteed NOT to be required to solve any problem on the midterm:
    • Java I/O, file processing, Scanner
    • programming with inheritance (extending a class, etc.)
    • writing an interface (though you might have to write a method that accepts a parameter of interface type, such as List, Set, Map, etc.
    • testing, debugging, commenting
    • grammars/regex
    • ArrayIntListIterator
    • recursive backtracking

Additional Sample Problems:

If you are a real practice problem junkie and want even MORE problems, here are links to a few other past exams. They don't exactly match the current exam format, and they are not in our Practice-It system, so they may be of limited use. Some of the problems on these tests don't match the topics, difficulty level, and/or type of questions we currently plan to ask. (For example, a lot of these exams ask problems about inheritance and about arrays.) These links are provided merely as a convenience and as another study aid.

Rules and Information:

  • You must show your UW Student ID card to a TA or the instructor for your submitted exam to be accepted.
  • You will have 60 minutes to complete the exam. You may receive a deduction if you keep working after the instructor calls for papers.
  • The exam is closed book. You will have a cheat sheet provided by the instructor (see above). You must work alone and may not use any computing devices of any kind including calculators. Cell phones, music players, and other electronic devices may NOT be out during the exam for any reason.
  • Unless a question specifically mentions otherwise, your code you write will be graded purely on external correctness (proper behavior and output) and not on internal correctness (style). So, for example, redundancy or lack of comments will not reduce your score.
  • You don't need to write any import statements in your exam code.
  • Do not abbreviate any code on the exam.
  • Please be quiet during the exam. If you have a question or need, please raise your hand.
  • Corrections or clarifications to the exam will be written at the front of the room.
  • If you violate the University Code of Conduct during the exam, you may receive a 0% for the exam and possibly further punishment.
  • When you have finished the exam, please turn in your exam quietly and leave the room.
  • If you enter the room, you must turn in an exam paper and will not be permitted to leave the room without doing so.