CMP 338: Data Structures and Algorithms
Design, analysis, and implementation of fundamental data structures and algorithms. Topics encompass asymptotic complexity (Big-O), linked lists, stacks, queues, binary search trees, AVL/red-black trees, heaps, hash tables, sorting algorithms, and graph…
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: CMP 338
Study Resources for Data Structures and Algorithms
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 6
Assessment Inventory for CMP 338 (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 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
Design, analysis, and implementation of fundamental data structures and algorithms. Topics encompass asymptotic complexity (Big-O), linked lists, stacks, queues, binary search trees, AVL/red-black trees, heaps, hash tables, sorting algorithms, and graph traversal algorithms.
This archive catalogs 11 free educational resources and past exams for CMP 338 (Data Structures and Algorithms) at Lehman College, 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
- Asymptotic time and space complexity analysis (Big-O, Big-Omega) applied to operations in CMP 338
- 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 CMP 338 archive?
This collection for CMP 338 at Lehman College 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 CMP 338 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 CMP 338 past exams?
All cataloged CMP 338 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 Lehman College course syllabus.