Prereq: MET CS 248 and MET
CS 341 or MET CS 342 (or instructor's consent)
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.
4 cr
| CS 566 Syllabus (pdf) | Spring 08 | Boston | 1/10/08 |
| CS 566 Syllabus (pdf) | Spring 08 | Tyngsboro | 3/1/08 |
| CS 566 Syllabus (html) | Summer 08 | Tyngsboro | 3/1/08 |
