CS 146: Elementary Algorithm Design and Data Abstraction (Advanced Level)
CS146 is an advanced-level version of CS136.
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 146, CS146
Study Resources for Elementary Algorithm Design and Data Abstraction (Advanced Level)
Midterm (Exam 1) 2012
Midterm (Exam 2) 2019
Final Exam 2018
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 CS 146 (10 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 2) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2019 | Midterm | 2019 | Illustrative Archive |
| Final Exam 2018 | Final | 2018 | 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 |
| Midterm (Exam 1) 2014 | Midterm | 2014 | Illustrative Archive |
| Midterm (Exam 1) 2012 | Midterm | 2012 | 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 CS 146 (Elementary Algorithm Design and Data Abstraction (Advanced Level)) at University of Waterloo (UW), containing 8 midterm papers, 1 final examination, and 1 worksheet. Dated documents represent 7 distinct academic years between 2012 and 2020.
Core Exam Topics & Learning Objectives
- Algorithmic design paradigms: divide-and-conquer, greedy optimization, and dynamic programming in CS 146
- Network flow, bipartite matching, and polynomial-time reductions (NP-completeness proofs)
- Graph algorithms: Dijkstra, Bellman-Ford, Prim, Kruskal, and topological sorting in Elementary Algorithm Design and Data Abstraction (Advanced Level)
- Amortized analysis, randomized algorithms, and recurrence relation solutions via the Master Theorem
Frequently Asked Questions
Which assessment formats are cataloged in this CS 146 archive?
This collection for CS 146 at University of Waterloo (UW) 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 CS 146 collection?
Dated materials in this archive span from 2012 to 2020, representing 7 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CS 146 past exams?
All cataloged CS 146 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 University of Waterloo (UW) course syllabus.