3500. Algorithms and Complexity
3.00 credits
Prerequisites:
Grading Basis: Graded
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.
Last Refreshed: 20-DEC-24 05.20.17.275138 AM
To view current class enrollment click the refresh icon next to the enrollment numbers.
| Class Number | Campus | Instruction Mode | Instructor | Section | Schedule | Location | Enrollment | Credits | Notes | |
|---|---|---|---|---|---|---|---|---|---|---|
| 1253 5886 1 004 | 5886 | Storrs | In Person | Aguiar, Derek | 004 | TuTh 2:00pm‑3:15pm |
ITE C80 | 2/20 | 3.00 |