CSC 575 - Algorithm and Complexity Analysis

Graduate standing. (4)

Algorithm efficiency, asymptotic notation, solutions to recurrence relations. Greedy algorithms for graphs, scheduling problems, and greedy heuristic methods. Divide and conquer algorithms for sorting and numeric computation. Dynamic programming. Graph algorithms including DFS and BFS. Probabilistic algorithms. Introduction to complexity theory. Graded ABCDE