CSC 411 Analysis of Algorithms

This course presents the fundamental techniques for designing and analyzing computer algorithms, providing their correctness, and analyzing their time complexity. Topics include sorting and selection algorithms, and basic algorithm design paradigms including brute force, divide-and-conquer, greedy technique, dynamic programming, and basic graph algorithms.

Credits

3