COMPSCI 2C03: Data Structures and Algorithms
A core study of data structures and algorithms, analyzing time/space complexities (Big-O), arrays, linked lists, stacks, queues, trees, heaps, hash tables, sorting algorithms, and graph traversals.
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: COMPSCI 2C03
Study Resources for Data Structures and Algorithms
Midterm (Exam 1) 2012
Midterm (Exam 2) 2010
Final Exam 2014
Midterm (Exam 1) 2014
Midterm (Exam 1) 2015
Midterm (Exam 1) 2016
Midterm (Exam 1) 2018
Midterm (Exam 1) 2019
Midterm (Exam 1) 2020
Worksheet 9
Assessment Inventory for COMPSCI 2C03 (10 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 1) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 1) 2016 | Midterm | 2016 | Illustrative Archive |
| Midterm (Exam 1) 2015 | Midterm | 2015 | Illustrative Archive |
| Final Exam 2014 | Final | 2014 | Illustrative Archive |
| Midterm (Exam 1) 2014 | Midterm | 2014 | Illustrative Archive |
| Midterm (Exam 1) 2012 | Midterm | 2012 | Illustrative Archive |
| Midterm (Exam 2) 2010 | Midterm | 2010 | Illustrative Archive |
| Worksheet 9 | Worksheet | — | Illustrative Archive |
Complete inventory of all 10 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
This archive catalogs 10 free educational resources and past exams for COMPSCI 2C03 (Data Structures and Algorithms) at McMaster University, containing 8 midterm papers, 1 final examination, and 1 worksheet. Dated documents represent 8 distinct academic years between 2010 and 2020.
Core Exam Topics & Learning Objectives
- Asymptotic time and space complexity analysis (Big-O, Big-Omega) applied to operations in COMPSCI 2C03
- Linear and non-linear data structures: balanced search trees (AVL, Red-Black), heaps, and hash map collision resolution
- Graph representations (adjacency list/matrix) and traversals: BFS, DFS, and shortest path algorithms in Data Structures and Algorithms
- Advanced data structure design: union-find disjoint sets, tries, and priority queue implementations
Frequently Asked Questions
Which assessment formats are cataloged in this COMPSCI 2C03 archive?
This collection for COMPSCI 2C03 at McMaster University catalogs 10 total resources across the following formats: Midterms, Finals, Worksheets. 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 COMPSCI 2C03 collection?
Dated materials in this archive span from 2010 to 2020, representing 8 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free COMPSCI 2C03 past exams?
All cataloged COMPSCI 2C03 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 McMaster University course syllabus.