CSE 143: Computer Programming II, Summer 2016

Dates:

• Midterm: Friday, July 22, 10:50-11:50
• Final, Part 1: Thursday, August 18, in your regular section
• Final, Part 2: Friday, August 19, 10:50-11:50

Seat Assignments:

• Gowen 301 (all sections): list, map

Contact Jonathan Sanders if you have any questions about the seat assignments (jsanders@cs.washington.edu).

Exam Rules and Information:

• You will have an assigned seat and you must sit in that seat. If you arrive for the exam and find someone else in your seat, ask them to move because we will move students to their assigned seats. We will take pictures of the room to help us verify that students sit in their assigned seats (please contact us if you have a concern about this).
• We may ask to check your UW ID card during the exam so please have it ready.
• You will have 60 minutes to complete the midterm and 60 minutes to complete each part of the final. We will distribute the exam early and you can read and fill out the cover page of the exam, but you should not look at the exam questions until you are told to begin. At the end when time is called, you are required to stop writing and close your exam. Students who look at the exam before being told to begin and students who make changes to their exam after time is called will receive a 10-point penalty. Students who do not close their exam booklet when time is called may also receive a 10-point penalty.
• The exams are closed-book and closed-note. You must work alone and may not use any computing devices of any kind including calculators or digital copies of the textbook. Cell phones, music players, and other electronic devices may NOT be out during the exam for any reason.
• There will be a cheat sheet included as the last page of the exam. You may remove this from your exam if you wish once the exam begins, but be sure to hold the staple when you remove the exam because otherwise your exam is likely to come apart. Space will be provided for your answers and you may use the back of the cheat sheet as scratch paper. If you need additional scratch paper, raise your hand and a TA will give it to you. You are not allowed to use your own paper during the exam.
• Unless a question specifically mentions otherwise, the 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 are, however, required to declare all data fields as private, to use generics properly, and to declare variables and parameters using interfaces when possible. The midterm cheat sheet mentions important restrictions on Stacks and Queues that you must follow.
• Unless otherwise specified, you should write each solution as a public instance method. You may define helper methods as part of your solution, but they should be declared to be private.
• You don't need to write any import statements in your exam code.
• You are not allowed to use advanced material to solve exam problems. In general, you are restricted to the classes and methods listed on the exam cheat sheet.
• You are not allowed to use break statements or a return from a void method.
• For standard Java classes such as Math and String, you are limited to the methods listed on the cheat sheet. You are not allowed to use the Arrays or Collections classes or other standard classes and methods that aren't included on the cheat sheet.
• Please be quiet during the exam. If you have a question or need assistance, please raise your hand.
• When you have finished the exam, please turn in your exam quietly and leave the room.

Final results:

average: 72.79

median: 74

final key

Regrades:

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

• E-mail Connor a detailed description of why you believe your problem(s) were graded incorrectly.
• Give Connor your original final exam either by dropping it off at the front office (before 9/7) or by sliding it under his door (office 212, after 9/7)
• All regrade requests must be received by Wednesday, September 28th (beginning of Fall quarter).
• Connor will regrade your entire exam meaning that your exam score may go down as a result of a regrade request

Final exam:

cheat sheet (will be provided as last page of exam)

The final will be split into two days (as specified in dates above). The problems below will be split over the two days.

Final Content

The final will be of the following structure (though the questions may be reordered).

Question	Description
1	Binary Tree Traversal
2	Binary Search Tree
3	Inheritance/Polymorphism
4	Collections Mystery
5	Binary Tree Programming
6	Comparable
7	Binary Tree Programming
8	Collections Programming
9	Linked Lists
10	Bonus

The bonus problem is a simple 1 point problem that you do not need to study for. It often has little to do with programming.

Practice Exams and Problems:

We strongly suggest that you try to solve all of these problems yourself, on paper, without a computer, and without looking at the answer key until you're done. You may also want to time yourself to practice your pacing.

Additional practice problems can be found on Practice-It or by category here

• practice final exam #0
• practice final exam #1 ( answer key)
• practice final exam #2 ( answer key)
• practice final exam #3 ( answer key) (09wi's final)
• practice final exam #4 ( answer key)
• practice final exam #5 ( answer key) (10wi's final)
• practice final exam #6 ( answer key) (11wi's final)

Results:

Midterm Key

Stats:

MEDIAN	85
AVG	79.98

question	average
Q1 (Recursive mystery)	12.3 / 15
Q2 (Recursive programming)	11.7 / 15
Q3 (Collections)	16.3 / 20
Q4 (Linked Lists before/after)	12.3 / 15
Q5 (Stacks and Queues)	17.9 / 20
Q8 (ArrayList Programming)	9.5 / 15

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 Connor to regrade it, you must:

• Type in the problem(s) to a Java file exactly as it appears on your exam.
• E-mail Connor a detailed description of why you believe your problem(s) were graded incorrectly. Attach the Java file with your code.
• For the Stacks + Queues question, if you can find ONE LINE that can be added/removed that would make your solution correct and tell us what that line is, Connor regrade that problem at a 5 point charge. (That is, your score would be capped at 15 out of 20)
• Give Connor your original midterm either in person or slide it under his door in CSE212.
• All regrade requests must be received by Tuesday August 2nd.
• Connor will regrade your entire exam meaning that your exam score may go down as a result of a regrade request

Midterm Resources:

• midterm cheat sheet
• old exam questions (Note we will not have Inheritance/polymorphism on our midterm)

Practice-It

Practice-It has many sample midterms. We recommend that you practice on paper (see below).

Practice Exams

We strongly suggest that you try to solve all of these problems yourself, on paper, without a computer, and without looking at the answer key until you're done. You may also want to time yourself to practice your pacing.

• Practice Midterm #1
• Practice Midterm #2
• Practice Midterm #3
• Practice Midterm #4
• Practice Midterm #5
• Practice Midterm #6 (Solutions)

Midterm Content

The midterm will have the following structure (although the problems might be reordered to facilitate copying):

Question	Description
1	Recursive Tracing
2	Recursive Programming
3	Linked Lists before/after
4	Collections
5	Stacks/Queues
6	Array Programming