COMP 352: Data Structures and Algorithms
Abstract data types: stacks and queues, trees, priority queues, dictionaries. Data structures: arrays, linked lists, heaps, hash tables, search trees. Design and analysis of algorithms: asymptotic notation, recursive algorithms, searching and sorting, tree…
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 352
Study Resources for Data Structures and Algorithms
Midterm (Exam 1) 2017
Midterm (Exam 2) 2017
Final Exam 2013
Midterm (Exam 1) 2018
Midterm (Exam 1) 2019
Midterm (Exam 1) 2020
Quiz 8
Assessment Inventory for COMP 352 (7 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) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 2) 2017 | Midterm | 2017 | Illustrative Archive |
| Final Exam 2013 | Final | 2013 | Illustrative Archive |
| Quiz 8 | Quiz | — | Illustrative Archive |
Complete inventory of all 7 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
Abstract data types: stacks and queues, trees, priority queues, dictionaries. Data structures: arrays, linked lists, heaps, hash tables, search trees. Design and analysis of algorithms: asymptotic notation, recursive algorithms, searching and sorting, tree traversal, graph algorithms. Lectures: three hours per week. Tutorial: one hour per week.
This archive catalogs 7 free educational resources and past exams for COMP 352 (Data Structures and Algorithms) at Concordia University, containing 5 midterm papers, 1 final examination, and 1 quiz. Dated documents represent 5 distinct academic years between 2013 and 2020.
Core Exam Topics & Learning Objectives
- Asymptotic time and space complexity analysis (Big-O, Big-Omega) applied to operations in COMP 352
- 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 COMP 352 archive?
This collection for COMP 352 at Concordia University catalogs 7 total resources across the following formats: Midterms, Finals, Quizzes. 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 352 collection?
Dated materials in this archive span from 2013 to 2020, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free COMP 352 past exams?
All cataloged COMP 352 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 Concordia University course syllabus.