CS 241: Data Structures and Algorithms
A thorough exploration of fundamental abstract data types, memory structures, and algorithm design. Key areas include linked lists, stacks, queues, binary trees, heaps, balanced search trees, hash tables, graph representations, and formal asymptotic…
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 241
Study Resources for Data Structures and Algorithms
Midterm (Exam 1) 2015
Midterm (Exam 2) 2019
Final Exam 2012
Midterm (Exam 1) 2017
Midterm (Exam 1) 2018
Midterm (Exam 1) 2020
Quiz 1
Quiz 2
Worksheet 4
Assessment Inventory for CS 241 (9 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 2) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 1) 2015 | Midterm | 2015 | Illustrative Archive |
| Final Exam 2012 | Final | 2012 | Illustrative Archive |
| Quiz 1 | Quiz | — | Illustrative Archive |
| Quiz 2 | Quiz | — | Illustrative Archive |
| Worksheet 4 | Worksheet | — | Illustrative Archive |
Complete inventory of all 9 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
A thorough exploration of fundamental abstract data types, memory structures, and algorithm design. Key areas include linked lists, stacks, queues, binary trees, heaps, balanced search trees, hash tables, graph representations, and formal asymptotic analysis of sorting and searching algorithms.
This archive catalogs 9 free educational resources and past exams for CS 241 (Data Structures and Algorithms) at Pace University, containing 5 midterm papers, 1 final examination, 2 quizzes, and 1 worksheet. Dated documents represent 6 distinct academic years between 2012 and 2020.
Core Exam Topics & Learning Objectives
- Asymptotic time and space complexity analysis (Big-O, Big-Omega) applied to operations in CS 241
- 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 CS 241 archive?
This collection for CS 241 at Pace University catalogs 9 total resources across the following formats: Midterms, Finals, Quizzes, 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 241 collection?
Dated materials in this archive span from 2012 to 2020, representing 6 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CS 241 past exams?
All cataloged CS 241 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 Pace University course syllabus.