CS 136: Elementary Algorithm Design and Data Abstraction
This course builds on the techniques and patterns learned in CS135 while making the transition to use an imperative language. It introduces the design and analysis of algorithms, the management of information, and the programming mechanisms and…
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 136, CS136
Study Resources for Elementary Algorithm Design and Data Abstraction
Final Exam 2015
Midterm (Exam 1) 2012
Midterm (Exam 2) 2010
Midterm (Exam 1) 2014
Midterm (Exam 1) 2017
Quiz 3
Assessment Inventory for CS 136 (6 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Final Exam 2015 | Final | 2015 | 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 |
| Quiz 3 | Quiz | — | Illustrative Archive |
Complete inventory of all 6 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
This course builds on the techniques and patterns learned in CS135 while making the transition to use an imperative language. It introduces the design and analysis of algorithms, the management of information, and the programming mechanisms and methodologies required in implementations. Topics discussed include iterative and recursive sorting algorithms; lists, stacks, queues, trees, and their application; abstract data types and their implementations.
This archive catalogs 6 free educational resources and past exams for CS 136 (Elementary Algorithm Design and Data Abstraction) at University of Waterloo (UW), containing 4 midterm papers, 1 final examination, and 1 quiz. Dated documents represent 5 distinct academic years between 2010 and 2017.
Core Exam Topics & Learning Objectives
- Algorithmic design paradigms: divide-and-conquer, greedy optimization, and dynamic programming in CS 136
- 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
- Amortized analysis, randomized algorithms, and recurrence relation solutions via the Master Theorem
Frequently Asked Questions
Which assessment formats are cataloged in this CS 136 archive?
This collection for CS 136 at University of Waterloo (UW) catalogs 6 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 CS 136 collection?
Dated materials in this archive span from 2010 to 2017, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CS 136 past exams?
All cataloged CS 136 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.