CSCI3160

Code	Course Offering	CSCI3160
Title	Long Course Title	Design and Analysis of Algorithms	算法設計及分析
Overview	Long Description	Basics of algorithm analysis: correctness and time complexity. Techniques for designing efficient algorithms: greedy method, divide and conquer, and dynamic programming. Fundamental graph algorithms: graph traversals, minimum spanning trees and shortest paths. Introduction to complexity theory: polynomial-time reductions and NP-completeness. Not for students who have taken ESTR3104 or CSCI3190; Pre-requisites: CSCI2100 or CSCI2520 or ESTR2102, and CSCI2110 or ENGG2440 or ESTR2004.	算法分析基礎：正確性與時間複雜性。快速算法設計技術：貪婪策略、分治策略、動態規劃。圖算法基礎：圖搜索、最小生成樹、最短路徑。複雜性理論入門：多項式時間變換、NP 完全理論性。