About
SC2301 Algorithm Design & Analysis, NTU AY25/26 Semester 1
What is here
| Product | What it holds |
|---|---|
| Lecture notes | 11 chapters, Weeks 1 to 11: sorting, graphs, greedy algorithms, recurrences, amortized analysis, dynamic programming and string matching. |
| Tutorial revision | Tutorials 1–6 and 8–10 with the official answers, on one page. |
Pending
What the notes do not cover yet:
- Week 12, NP-completeness: the lecture is not released yet. The past-year papers test it.
- Shortest paths in DAGs: the dynamic programming outline lists it, but its slides are not released. Chapter 10 gives a short standard version.
- Tutorial 11 (string matching): not released yet.
- Tutorial revision page: covers Tutorials 1–6 and 8–10, the ones with official solutions. There is no Tutorial 7. Past-paper questions are not on it yet.