CSE 143: Computer Programming II, Summer 2014

• answer key

Results:

You can now check your final exam score on MyUW (see instructions). Your exam wil be available to pick up from the CSE front office starting at 12pm on 8/26. Please pick up your exam before asking grading questions.

The average is 79.71% and the median is about 81% — well done! Scores will not be adjusted.

Regrades:

If you believe that one or more problems were incorrectly graded and you would like Kevin to regrade it, you must:

• Write a brief cover page describing what problem(s) you would like regraded and why.
• Give the exam to the receptionist (Rebecca) in the CSE Department Office, and tell her to put in in Kevin Quinn's mailbox.
• All regrade requests must be received by Monday, October 6th.
• Kevin will regrade your entire exam meaning that your exam score may go down as a result of a regrade request.

Time/Place:

• Date: Thursday, August 21 and Wednesday, August 22, 2014
• Time: 60 minutes each day
• Place: in your section (Thursday) and in normal lecture room (Friday) (GUG 220)
• Cheat sheet
• You must sit in your assigned seat. The seat assignments are: list, map.

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 final exam (key at the bottom)

Our actual final exam will be most similar to the practice exam above (ignore the Collections Mystery problem). Additional practice problems can be found in Practice-It, by browsing previous quarter's web pages, or in the PDFs below:

• 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)

The questions on the final exam will be selected from the following. Each question will be worth between 10-20 points:

• Binary search trees: Given a set of values, add them to a binary search tree. Then perform traversals in the three standard orders on that tree.
• Polymorphism mystery: Given a set of classes with inheritance relationships, a set of variables declared using those classes, and a set of method calls made on those variables, write the output. (similar to section 19 problems)
• Comparable programming: Given a specification, write a complete class that implements the Comparable interface based on a given set of comparison criteria. (similar to section 15 problems)
• Collections programming: Write a method that uses one or more class from the Java Collections framework (with focus on Sets and Maps) (same as the midterm but harder).
• Binary tree programming: Add a method to the IntTree class from lecture. (similar to section 12, 13 problems)
• Binary tree programming: Add a method to the IntTree class from lecture. Similar in spirit to the previous question but harder (likely involves modifying or building a tree).
• Linked list programming: Add a method to the LinkedIntList class from lecture. (similar to section 6, 16 problems)
• recursive backtracking : Write code to solve a problem using recursive backtracking (on the easier side of question from section) or answer basic questions about recursive backtracking
• General Sorting knowledge

The following topics are guaranteed NOT to be explicitly tested on the final exam:

• detailed knowledge of Big-Oh (some questions may ask you to solve them within a certain big-Oh limit, but mainly this is just to ward off extremely inefficient answers)
• writing code with 2-D arrays
• catching exceptions
• priority queues
• input/output streams
• abstract classes
• inner classes
• implementing an Iterator class
• implementing a "generic" class (one that accepts type parameters such as <T>)
• hashing

• answer key

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 +4 point shift added to everyone's score.

Stats:

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

• Type in the problem(s) to the appropriate test file below exactly as it appears on your exam. (There is no test code for problem 6).
  • Test3.java(problem 3)
  • Test4.java(problem 4)
  • Test5.java(problem 5)
  • Test7.java(problem 7)
• Print out the output of running the test.
• Write a brief cover page describing what problem(s) you would like regraded and why.
• Give Kevin your original midterm, your test results, and your cover page
• All regrade requests must be received by Wednesday, August 6th.
• Kevin 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 28, 2014
• Time: 60 minutes
• Place: in normal lecture room (GUG 220)
• Cheat sheet (will be stapled to your exam)

Practice Exams:

• practice midterm #1
• practice midterm #2
• practice midterm #3
• practice midterm #4
• practice midterm #5
• practice midterm #6 (10wi's midterm) ( answer key)
• practice midterm #7 (11wi's midterm) ( answer key)
• practice midterm #8 (12 wi's midterm) (answer key)
• More practice problems can be found in the textbook and in our Practice-It! tool.
• Sample midterm exam(s) posted here are intended to be very similar to the actual midterm. The number of problems and type of problems on the actual exam will be much like what is seen on these practice exams. Material from Weeks 1-5 is considered "fair game" for questions on the actual midterm (excluding recursive backtracking).

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)
• linked list programming (add a method to the LinkedIntList class)
• 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