CSCI0500
Data Structures, Algorithms, and Intractability: An Introduction
Fall 2025
This course will cover the basics of how to design and analyze data structures and algorithms. We will develop algorithmic intuition through rigorous analysis of algorithmic correctness and performance. We will also study the theory of NP-completeness, which helps us understand which problems are computationally intractable.
| Instructor(s): | |
| Meets: | MW 3pm-4:20pm Location TBD |
| Exam: | If an exam is scheduled for the final exam period, it will be held: |
| Max Seats: | 100 |
| CRN: | 18189 |
Spring 2026
As above
| Instructor(s): | |
| Meets: | MW 3pm-4:20pm Location TBD |
| Exam: | If an exam is scheduled for the final exam period, it will be held: |
| Max Seats: | 75 |
| CRN: | 26693 |
