CS 146: Data Structures and Algorithms
CS 146 is SJSU's core data structures and algorithms course. You'll implement and analyze the performance of fundamental data structures — arrays, linked lists, trees, heaps, hash tables, and graphs — and master algorithm design techniques like…
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
Study Resources for Data Structures and Algorithms
Midterm (Exam 1) 2015
Midterm (Exam 2) 2009
Final Exam 2011
Midterm (Exam 1) 2017
Midterm (Exam 1) 2018
Midterm (Exam 1) 2020
Quiz 1
Quiz 2
Worksheet 2
Assessment Inventory for CS 146 (9 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2020 | Midterm | 2020 | 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 2011 | Final | 2011 | Illustrative Archive |
| Midterm (Exam 2) 2009 | Midterm | 2009 | Illustrative Archive |
| Quiz 1 | Quiz | — | Illustrative Archive |
| Quiz 2 | Quiz | — | Illustrative Archive |
| Worksheet 2 | 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
CS 146 is SJSU's core data structures and algorithms course. You'll implement and analyze the performance of fundamental data structures — arrays, linked lists, trees, heaps, hash tables, and graphs — and master algorithm design techniques like divide-and-conquer, greedy strategies, and dynamic programming.
This archive catalogs 9 free educational resources and past exams for CS 146 (Data Structures and Algorithms) at San José State University (SJSU), containing 5 midterm papers, 1 final examination, 2 quizzes, and 1 worksheet. Dated documents represent 6 distinct academic years between 2009 and 2020.
Core Exam Topics & Learning Objectives
- Asymptotic analysis: Big-O, Big-Omega, Big-Theta, recurrence relations, and the Master Theorem
- Dynamic arrays, singly/doubly linked lists, stacks, and queues
- Binary search trees, AVL tree rotations, red-black tree properties, and heap operations
- Sorting: Quicksort partitioning, Mergesort analysis, Heapsort, and the Ω(n log n) lower bound
- Hash tables: designing hash functions, chaining vs. open addressing, and load factor management
- Graph algorithms: BFS, DFS, Dijkstra's shortest path, and MST construction (Kruskal's and Prim's)
Frequently Asked Questions
Which assessment formats are cataloged in this CS 146 archive?
This collection for CS 146 at San José State University (SJSU) 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 146 collection?
Dated materials in this archive span from 2009 to 2020, representing 6 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 San José State University (SJSU) course syllabus.