Course Information

Welcome to CSCI 0500 - Data Structures, Algorithms, and Intractability: An Introduction!

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.

Lectures: M/W 3–4:20 PM (All lectures will be recorded)
Location: see CAB
Textbook: Algorithmic Foundations: Data Structures, Algorithms, and Intractability. Philip Klein and Algorithm Design. Kleinberg and Tardos

Useful Links

• Canvas Page
• Course Syllabus
• Gradescope
• Edstem
• Lecture Recordings (Panopto)
• Anonymous feedback form

Lecture slides will be released in advance for every lecture. For the list of lectures, see: Lectures

Waitlist Information

Please send an override request through CAB. No further action is necessary. Whenever slots are available, codes are sent out in the evening of every workday. Starting during the shopping period, codes that are unredeemed for 24 hours will be revoked.