CS 463 Algorithms
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.
Credits
3
Prerequisite
Grade C- or better in
CS 253 or (for graduates)
CS 501.