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:
To view current class enrollment click the refresh icon next to the enrollment numbers.
| Term | Class Number | Campus | Instruction Mode | Instructor | Section | Session | Schedule | Enrollment | Location | Credits | Grading Basis | Notes |
|---|