COMP 251: Algorithms and Data Structures
An in-depth study of advanced data structures and algorithm design techniques. Covers balanced search trees, heaps, disjoint sets, graph algorithms (shortest paths, minimum spanning trees), dynamic programming, greedy algorithms, divide-and-conquer…
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: COMP 251
Study Resources for Algorithms and Data Structures
Assessment Inventory for COMP 251 (5 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 2) 2016 | Midterm | 2016 | Illustrative Archive |
| Final Exam 2013 | Final | 2013 | Illustrative Archive |
| Study Guide 5 | Study Guide | — | Illustrative Archive |
Complete inventory of all 5 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
An in-depth study of advanced data structures and algorithm design techniques. Covers balanced search trees, heaps, disjoint sets, graph algorithms (shortest paths, minimum spanning trees), dynamic programming, greedy algorithms, divide-and-conquer strategies, and NP-completeness.
This archive catalogs 5 free educational resources and past exams for COMP 251 (Algorithms and Data Structures) at McGill University, containing 3 midterm papers, 1 final examination, and 1 study guide. Dated documents represent 4 distinct academic years between 2013 and 2019.
Core Exam Topics & Learning Objectives
- Asymptotic time and space complexity analysis (Big-O, Big-Omega) applied to operations in COMP 251
- 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 Algorithms and Data Structures
- Advanced data structure design: union-find disjoint sets, tries, and priority queue implementations
Frequently Asked Questions
Which assessment formats are cataloged in this COMP 251 archive?
This collection for COMP 251 at McGill University catalogs 5 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 COMP 251 collection?
Dated materials in this archive span from 2013 to 2019, representing 4 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free COMP 251 past exams?
All cataloged COMP 251 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 McGill University course syllabus.