Analysis of Algorithms

MET CS 566

Discusses basic methods for designing and analyzing efficient algorithms emphasizing methods used in practice. Topics include sorting, searching, dynamic programming, greedy algorithms, advanced data structures, graph algorithms (shortest path, spanning trees, tree traversals), matrix operations, string matching, NP completeness.

FALL 2016 Schedule

Section Instructor Location Schedule Notes
A1 Chakraborty MCS B33 M 6:00 pm-9:00 pm

SPRG 2017 Schedule

Section Instructor Location Schedule Notes
A1 Chakraborty M 6:00 pm-8:45 pm

Note: this course was also offered during Summer Term

Note that this information may change at any time. Please visit the Student Link for the most up-to-date course information.