CSCI0500

Data Structures, Algorithms, and Intractability: An Introduction

Fall 2026

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:
TTh 2:30pm-3:50pm
Exam Group:TBA
Max Seats:90
CRN:13674

Spring 2027

As above

Instructor(s):
Meets:
MW 3pm-4:20pm
Exam Group:TBA
Max Seats:73
CRN:24576