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 2013 Schedule
|C1||Naidjate||SMG 302||W 6:00 pm-9:00 pm|
SPRG 2014 Schedule
|A1||Lee||MCS B23||M 6:00 pm-9:00 pm|
Note: this course was also offered during Summer Term