COMP 2402: Abstract Data Types and Algorithms
An in-depth investigation into abstract data types, fundamental data structures, and asymptotic algorithm analysis. Explores arrays, linked lists, hash tables, balanced binary search trees, heaps, priority queues, and sorting algorithms with a focus on…
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 2402
Study Resources for Abstract Data Types and Algorithms
Midterm (Exam 1) 2017
Midterm (Exam 2) 2017
Final Exam 2015
Midterm (Exam 1) 2018
Midterm (Exam 2) 2018
Midterm (Exam 1) 2019
Midterm (Exam 2) 2019
Midterm (Exam 1) 2020
Midterm (Exam 2) 2020
Study Guide 2
Quiz 6
Assessment Inventory for COMP 2402 (11 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 2) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 1) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 2) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 2) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 2) 2017 | Midterm | 2017 | Illustrative Archive |
| Final Exam 2015 | Final | 2015 | Illustrative Archive |
| Study Guide 2 | Study Guide | — | Illustrative Archive |
| Quiz 6 | Quiz | — | Illustrative Archive |
Complete inventory of all 11 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 investigation into abstract data types, fundamental data structures, and asymptotic algorithm analysis. Explores arrays, linked lists, hash tables, balanced binary search trees, heaps, priority queues, and sorting algorithms with a focus on runtime and space efficiency.
This archive catalogs 11 free educational resources and past exams for COMP 2402 (Abstract Data Types and Algorithms) at Carleton University, containing 8 midterm papers, 1 final examination, 1 quiz, and 1 study guide. Dated documents represent 5 distinct academic years between 2015 and 2020.
Core Exam Topics & Learning Objectives
- Algorithmic design paradigms: divide-and-conquer, greedy optimization, and dynamic programming in COMP 2402
- Network flow, bipartite matching, and polynomial-time reductions (NP-completeness proofs)
- Graph algorithms: Dijkstra, Bellman-Ford, Prim, Kruskal, and topological sorting in Abstract Data Types and Algorithms
- Amortized analysis, randomized algorithms, and recurrence relation solutions via the Master Theorem
Frequently Asked Questions
Which assessment formats are cataloged in this COMP 2402 archive?
This collection for COMP 2402 at Carleton University catalogs 11 total resources across the following formats: Midterms, Finals, Quizzes, 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 2402 collection?
Dated materials in this archive span from 2015 to 2020, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free COMP 2402 past exams?
All cataloged COMP 2402 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 Carleton University course syllabus.