CS 5110 Algorithms and Data Structures 3.0 Credits
This course introduces tools for the analysis of algorithms (asymptotic notation, proof of correctness, recurrences) and techniques for algorithm design (greedy, divide-and-conquer, dynamic programming). It also covers fundamental algorithms (sorting, finding order statistics, depth-first and breadth-first search, connected components, minimum spanning trees, shortest paths, maximum flow, matching in bipartite graphs), data structures (binary heaps, binary search trees, balanced search trees, hash tables), and NP-completeness.
Repeat Status: Not repeatable for credit
Prerequisites: (CS 5010 [Min Grade: D] or CS 501 [Min Grade: D]) and (CS 5030 [Min Grade: D] or CS 502 [Min Grade: D])