Topics include asymptotic analysis of algorithms, brute force, divide and conquer, dynamic programming, greedy algorithms, graph and network algorithms, parallel and distributed algorithms. Theory of computational complexity is also considered.

Prerequisites: Grade C- or better in CS 253 or (for graduates) CS 501.

0 Credits

View in Catalog