HuskyScheduler Open the scheduler

CSE 3500: Algorithms and Complexity

Design and analysis of efficient computer algorithms. Algorithm design techniques, including divide-and-conquer, dynamic programming, and greedy approaches. Graph algorithms and advanced data structures. Worst-case and average-case analysis, reductions, and NP-completeness.

Credits
3
Offered
Spring 2027, Fall 2026
Campuses
Storrs, Stamford
Requirements
CSE 2050 or CSE 2100; CSE 2500; open only to students in the College of Engineering, Cognitive Science majors, and declared Computer Science minors.
Plan CSE 3500 in HuskyScheduler

Spring 2027 sections

Taught by Derek Aguiar, Pavel Skums, and Seiki Miura.

SectionTypeMeetsInstructorCampusRoomSeats
001LEC9:30AM - 10:45AM / TuThDerek AguiarStorrsMCHU 2021 of 60 open
002LEC3:30PM - 4:45PM / TuThPavel SkumsStorrsMCHU 3050 of 60 open
801LEC9:30AM - 10:45AM / TuThSeiki MiuraStamfordDWTN A232 of 60 open

Seats as of Nov 12, 2026. HuskyScheduler shows live seats when you search.

Fall 2026 sections

Taught by Sanguthevar Rajasekaran, Lina Kloub, and Pavel Skums.

SectionTypeMeetsInstructorCampusRoomSeats
001LEC2:00PM - 3:15PM / TuThSanguthevar RajasekaranStorrsMCHU 2029 of 50 open
002LEC12:30PM - 1:45PM / TuThLina KloubStorrsMCHU 3010 of 50 open
003LEC3:30PM - 4:45PM / TuThPavel SkumsStorrsITE 33616 of 50 open

Seats as of Nov 12, 2026. HuskyScheduler shows live seats when you search.

More courses

All CSE courses (Computer Science and Engineering) ยท All UConn subjects