COSCĀ 5319. Algorithm Design and Analysis. 3 Hours.
Students focus on how to design and analyze computing algorithms with emphasis on correctness, -efficiency, and feasibility. Topics may include asymptotic analysis, recurrences and divide-and-conquer algorithms, greedy algorithms, dynamic programming, graph algorithms, and randomized algorithms. Computational complexity theory and computability will also be discussed.