CS 567 - Advanced Algorithm

3 credit(s)
This course provides an in-depth study of advanced techniques for the design and analysis of algorithms, with an emphasis on both classical foundations and modern developments in the field. Students will review key mathematical tools for algorithmic analysis, explore advanced design paradigms, and evaluate the efficiency and correctness of algorithms across a range of applications. Topic covered in this course include asymptotic analysis, divide-and-conquer, randomized algorithms, advanced data structures, dynamic programming, greedy algorithms, amortized analysis, graph algorithms, shortest paths, flow networks, linear programming, string matching, and NP-completeness.
Prerequisite(s): CS 342 (Algorithms and Complexity) or Matriculation in the MS in CS program.

Click here for Class Search.