CS 2110: Object-Oriented Programming and Data Structures
CS 2110 is Cornell's intermediate programming course, taught in Java. Building on CS 1110/1112, it covers software engineering fundamentals — polymorphism, interfaces, generics — alongside core data structures like linked lists, trees, heaps, hash tables,…
Independent study archive Learn more
Materials are uploaded by users for self-study purposes. PwnHero is an independent platform, not affiliated with, sponsored by, or endorsed by any university or institution.
Common aliases: CS 2110, ENGRD 2110
Study Resources for Object-Oriented Programming and Data Structures
Assessment Inventory for CS 2110 (4 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 2) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Final Exam 2014 | Final | 2014 | Illustrative Archive |
| Study Guide 10 | Study Guide | — | Illustrative Archive |
Complete inventory of all 4 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
CS 2110 is Cornell's intermediate programming course, taught in Java. Building on CS 1110/1112, it covers software engineering fundamentals — polymorphism, interfaces, generics — alongside core data structures like linked lists, trees, heaps, hash tables, and graphs. You'll also learn to analyze algorithm efficiency using Big-O notation and build event-driven GUIs.
This archive catalogs 4 free educational resources and past exams for CS 2110 (Object-Oriented Programming and Data Structures) at Cornell University, containing 2 midterm papers, 1 final examination, and 1 study guide. Dated documents represent 3 distinct academic years between 2014 and 2019.
Core Exam Topics & Learning Objectives
- Big-O and Big-Omega analysis of time and space complexity
- Linked lists, stacks, queues, and their array-backed vs. node-based implementations
- Binary search trees, AVL trees, heaps, and hash table collision strategies
- Graph representations (adjacency list/matrix) and BFS/DFS traversals
- Shortest-path algorithms (Dijkstra's) and minimum spanning trees
- Java generics, polymorphism, interfaces, and event-driven GUI programming
Frequently Asked Questions
Which assessment formats are cataloged in this CS 2110 archive?
This collection for CS 2110 at Cornell University catalogs 4 total resources across the following formats: Midterms, Finals, Study Guides. Each document is listed in the assessment inventory table with its individual format tag and academic year where recorded.
What academic years are covered in this CS 2110 collection?
Dated materials in this archive span from 2014 to 2019, representing 3 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CS 2110 past exams?
All cataloged CS 2110 past exams and study materials are free to request. The catalog, metadata, assessment inventory, and illustrative thumbnails are public; source documents are not shown on this page. Use the connect options to request a study resource, and confirm current course topics and grading policies with the Cornell University course syllabus.