CS 138: Introduction to Data Abstraction and Implementation
Software abstractions via elementary data structures and their implementation; encapsulation and modularity; class and interface definitions; object instantiation; recursion; elementary abstract data types, including sequences, stacks, queues, and trees;…
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 138, CS138
Study Resources for Introduction to Data Abstraction and Implementation
Midterm (Exam 1) 2017
Midterm (Exam 2) 2017
Final Exam 2011
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 4
Assessment Inventory for CS 138 (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 2011 | Final | 2011 | Illustrative Archive |
| Study Guide 2 | Study Guide | — | Illustrative Archive |
| Quiz 4 | 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
Software abstractions via elementary data structures and their implementation; encapsulation and modularity; class and interface definitions; object instantiation; recursion; elementary abstract data types, including sequences, stacks, queues, and trees; implementation using linked structures and arrays; vectors and strings; memory models; automatic vs. dynamic memory management.
This archive catalogs 11 free educational resources and past exams for CS 138 (Introduction to Data Abstraction and Implementation) at University of Waterloo (UW), containing 8 midterm papers, 1 final examination, 1 quiz, and 1 study guide. Dated documents represent 5 distinct academic years between 2011 and 2020.
Core Exam Topics & Learning Objectives
- Fundamental programming constructs: variable typing, conditional logic, iterative loops, and modular functions in CS 138
- Memory models and data representations: arrays, string parsing, reference passing, and scope resolution
- Introduction to algorithmic thinking: linear/binary search, basic sorting algorithms, and recursive problem decomposition
- Software development practices: debugging methodologies, unit test assertions, and structured coding style in Introduction to Data Abstraction and Implementation
Frequently Asked Questions
Which assessment formats are cataloged in this CS 138 archive?
This collection for CS 138 at University of Waterloo (UW) 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 CS 138 collection?
Dated materials in this archive span from 2011 to 2020, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CS 138 past exams?
All cataloged CS 138 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.