CS 3358: Data Structures and Algorithms
Comprehensive study of advanced data structures, algorithm design, and asymptotic complexity analysis. Explores trees (binary search trees, AVL, red-black), heaps and priority queues, hash tables, graph representations, traversal algorithms (BFS, DFS),…
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 3358
Study Resources for Data Structures and Algorithms
Final Exam 2018
Midterm (Exam 1) 2014
Midterm (Exam 2) 2014
Midterm (Exam 1) 2017
Midterm (Exam 2) 2017
Quiz 1
Quiz 2
Worksheet 1
Assessment Inventory for CS 3358 (8 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Final Exam 2018 | Final | 2018 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 2) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 1) 2014 | Midterm | 2014 | Illustrative Archive |
| Midterm (Exam 2) 2014 | Midterm | 2014 | Illustrative Archive |
| Quiz 1 | Quiz | — | Illustrative Archive |
| Quiz 2 | Quiz | — | Illustrative Archive |
| Worksheet 1 | Worksheet | — | Illustrative Archive |
Complete inventory of all 8 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
Comprehensive study of advanced data structures, algorithm design, and asymptotic complexity analysis. Explores trees (binary search trees, AVL, red-black), heaps and priority queues, hash tables, graph representations, traversal algorithms (BFS, DFS), shortest path, and sorting algorithms. Emphasizes mathematical verification and Big-O runtime analysis.
This archive catalogs 8 free educational resources and past exams for CS 3358 (Data Structures and Algorithms) at Texas State University (TXST), containing 4 midterm papers, 1 final examination, 2 quizzes, and 1 worksheet. Dated documents represent 3 distinct academic years between 2014 and 2018.
Core Exam Topics & Learning Objectives
- Asymptotic complexity analysis: Big-O, Big-Omega, Big-Theta bounds, and recurrences via the Master Theorem in CS 3358
- Tree data structures: binary search trees, AVL self-balancing rotations, and B-trees at TXST
- Priority queues and sorting algorithms: binary heaps, heapify procedures, quicksort partitioning, and mergesort efficiency in Data Structures
- Graph algorithms and traversal strategies: breadth-first search, depth-first search, Dijkstra's shortest path, and Prim's MST for CS 3358
Frequently Asked Questions
Which assessment formats are cataloged in this CS 3358 archive?
This collection for CS 3358 at Texas State University (TXST) catalogs 8 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 3358 collection?
Dated materials in this archive span from 2014 to 2018, representing 3 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CS 3358 past exams?
All cataloged CS 3358 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 Texas State University (TXST) course syllabus.