CSC 6360 Foundations of Algorithms
The course introduces formal techniques for the design and analysis of algorithms, focusing on both the underlying mathematical theory and practical considerations of efficiency. Topics include computational complexity analysis, sorting and searching, divide-conquer techniques, greedy methods, and dynamic programming, graph algorithms, minimum spanning trees, and shortest distance and path problems.