Analysis of Algorithms
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.
2025FALLMETCS566A1, Sep 2nd to Dec 10th 2025
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| M | 06:00 PM | 08:45 PM | HAR | 408 |
2025FALLMETCS566A2, Sep 2nd to Dec 10th 2025
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| T | 06:00 PM | 08:45 PM | SOC | B57 |
2025FALLMETCS566O1, Sep 2nd to Oct 20th 2025
| Days | Start | End | Type | Bldg | Room |
|---|---|---|---|---|---|
| ARR | 12:00 AM | 12:00 AM |
Format & Syllabus:
CS566 A1 SPRG25CS566 A2 SPRG25CS566 A3 SPRG25CS566 A1 FA24CS566 A2 FA24CS566 A3 FA24CS566 A5 FA24CS566A1 SP24CS566A2 SP24CS566A3 SP24CS566A1F23CS566A3 F22CS566A2 SP22CS566A1 SPR22CS566 SUM21CS566A1 SPR21CS566A2 SPR21CS566A1FALL20CS566A2FALL20CS566A1FALL19CS566A2FALL19CS566A1SPRG19CS566C1SPRG19CS566 FALL18CS566 SPRG18CS566 FALL17CS566 SUM17CS566 SPRG16CS566 SUM16