What This Document Is
This document contains the complete solutions for the Fall 2010 final exam in Cornell University’s CS 2110: Object-Oriented Programming and Data Structures course. It’s a record of the expected answers and approaches to the exam questions.
Why This Document Matters
This resource is primarily valuable to students who took CS 2110 in Fall 2010, or instructors teaching the course who want example solutions. It serves as a check for understanding after attempting the exam, revealing the expected level of detail and correctness. It’s useful for identifying areas where a student’s approach differed from the instructor’s expectations.
Common Limitations or Challenges
This document provides solutions *after* the attempt to solve the problems. It doesn’t offer guidance on *how* to approach the problems initially, nor does it provide explanations of the underlying concepts. It assumes familiarity with the course material. It is specific to the 2010 iteration of the course and may not reflect changes in later versions.
What This Document Provides
The full document includes:
* Complete answers to five exam questions covering sort algorithms and Java exception handling.
* Detailed responses to questions about Quicksort, lexicographic sorting with `DIMSORT`, and the runtime analysis of the `SLOWSORT` algorithm.
* True/False questions related to Java’s `try-catch-finally` blocks, inheritance, and autoboxing.
* An extra credit problem (with solution) offering additional points.
* The document does *not* include the original exam questions themselves – only the solutions. This preview does not include any of the solutions, only a description of the document’s contents.
