HuskyScheduler
Open the scheduler
CSE 5050: Algorithms and Complexity
Design and analysis of efficient computer algorithms. Algorithm design techniques, including divide-and-conquer, depth-first search, and greedy approaches. Worst-case and average-case analysis. Models of computation. NP-complete problems.
- Credits
- 3
- Offered
- Spring 2027, Fall 2026
- Campuses
- Storrs
- Requirements
- Open to grad students in CSE, others with consent. Recommended preparation: Discrete math; fluency in a high-level programming language; data structures, algorithms at the level of CSE 2050. Students cannot receive credit for both CSE 3500 and 5050.
Spring 2027 sections
Taught by Mukul Bansal.
| Section | Type | Meets | Instructor | Campus | Room | Seats |
|---|---|---|---|---|---|---|
| 001 | LEC | TBA | Mukul Bansal | Storrs | Online | 30 of 30 open |
| 002 | LEC | TBA | Mukul Bansal | Storrs | Online | 19 of 20 open |
Seats as of Nov 12, 2026. HuskyScheduler shows live seats when you search.
Fall 2026 sections
Taught by Derek Aguiar.
| Section | Type | Meets | Instructor | Campus | Room | Seats |
|---|---|---|---|---|---|---|
| 001 | LEC | 11:00AM - 12:15PM / TuTh | Derek Aguiar | Storrs | ITE 125 | 9 of 30 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