CSE 143: Computer Programming II, Summer 2013

• 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 9am on 8/26. Please pick up your exam before asking grading questions.

The average is 81.7% and the median is 82% — well done! Scores will not be adjusted.

Stats:

Regrades:

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

• If applicable, type in the problem(s) to the appropriate test file below exactly as it appears on your exam.
  • FinalTest7.java
  • FinalTest8.java
• Print out the output of running the test.
• 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 Melissa Winstanley's mailbox.
• All regrade requests must be received by Monday, October 7th.
• Melissa 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 22 and Wednesday, August 23, 2013
• Time: 60 minutes each day
• Place: in your section (Thursday) and in normal lecture room (Friday) (EEB 105)
• Cheat sheet (will be stapled to your exam for Friday only)

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)

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)
• detailed knowledge of search/sort algorithms
• recursive backtracking (recursion will definitely be needed, but not specific backtracking problems)
• 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 +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:

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.
  • Test2.java
  • Test4.java
  • Test5.java
  • Test6.java
  • Test7.java
• 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:

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

• Summer 2012 | answer key (Obourn)
• Summer 2011 | answer key (Perkins)
• Spring 2011 | answer key (Reges)
• Winter 2011 | answer key (Stepp)
• Autumn 2010 | answer key (Reges)
• Summer 2010 (Limketkai)
• Spring 2010 | answer key (Reges)
• Winter 2010 | answer key (Stepp)
• Summer 2009 | answer key (Reges)
• Spring 2009 | answer key (Reges)
• Autumn 2008 | answer key (Reges)
• Summer 2008 | answer key (Reges)
• Spring 2008 | answer key (Reges)

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.