[ADA 2019] Algorithm Design and Analysis
Course Info | Syllabus | Teaching Team
Course Info
- Course number: CSIE 2136
- Location: R102
- Time: 14:20-17:10 (Thu.)
- Website: NTU COOL
Syllabus
| 1 |
Sep 12 |
Course Introduction |
| 2 |
Sep 19 |
What is algorithm? / Divide-and-Conquer |
| 3 |
Sep 26 |
Divide-and-Conquer |
| 4 |
Oct 03 |
Dynamic Programming |
| 5 |
Oct 10 |
Holiday; no class |
| 6 |
Oct 17 |
Dynamic Programming |
| 7 |
Oct 24 |
TBD |
| 8 |
Oct 31 |
Greedy Algorithms |
| 9 |
Nov 07 |
Greedy Algorithms |
| 10 |
Nov 14 |
Mid-term Exam |
| 11 |
Nov 21 |
Graph Algorithms |
| 12 |
Nov 28 |
Graph Algorithms |
| 13 |
Dec 05 |
Amortized Analysis |
| 14 |
Dec 12 |
NP Completeness |
| 15 |
Dec 19 |
NP Completeness |
| 16 |
Dec 26 |
Approximation Algorithms |
| 17 |
Jan 02 |
Some fun topics / review |
| 18 |
Jan 09 |
Final exam |
Teaching Team
- Email: ada-ta@csie.ntu.edu.tw