Algorithms

Algorithm analysis evaluates time and memory resource requirements of a proposed algorithm as a function of input length. Algorithm design studies techniques for constructing algorithms with minimal resource requirements. This course covers mainly the design and analysis for a number of important and common algorithms, including the Master theorem, divide and conquer, sorting and selection, dynamic programming, amortized analysis, graph traversal and connectivity, shortest paths, spanning trees, and network flow. This course will also cover basic NP-completeness theory and reduction techniques. In addition, hands-on projects will be assigned to the students to implement fundamental and advanced computer algorithms in real applications.

Offer as needed