CS3230 Design and Analysis of Algorithms Summary Note
CS3230 Design and Analysis of Algorithms introduces different techniques of designing and analysing algorithms. Students will learn about the framework for algorithm analysis, for example, lower bound arguments, average case analysis, and the theory of NP-completeness. In addition, students are exposed to various algorithm design paradigms. The course covers lower and upper bounds, recurrences, basic algorithm paradigms (such as prune-and-search, dynamic programming, branch-and-bound, graph traversal, and randomised approaches), amortized analysis, NP-completeness.
The summary note below is intended as a concise consolidation of the key concepts covered in the course. It is meant to serve as a revision aid and a structured overview of the material, rather than a complete or authoritative reference.
I may still have gaps in my understanding, and there may be omissions or inaccuracies in these notes. I would sincerely appreciate any corrections or feedback.
本人水平有限，笔记中可能存在疏漏或不严谨之处，恳请各位老师和同学不吝斧正。