MET CS 566
Analysis of Algorithms
Prerequisites: MET CS 342 or MET CS 526 or consent of instructor. Learn methods for designing and analyzing algorithms while practicing hands-on programming skills. Topics include divide-and-conquer, sorting, dynamic programming, greedy algorithms, advanced data structures, graph algorithms (shortest path, spanning trees, tree traversals), matrix operations, and NP-completeness.
Topics
- divide-and-conquer
- sorting
- dynamic programming
- greedy algorithms
- advanced data structures
- graph algorithms (shortest path
- spanning trees
- tree traversals)
- matrix operations
- and NP-completeness
Topics explicitly listed in official catalogue description
Sources
- Course catalogue ↗2026-2027