通過條件
成 績 :60 分
-
課程大綱
-
104 slides
-
104錄影
-
103 slides
-
103 錄影
-
102 slides
-
102 錄影
-
old version
-
簡介投影片
-
Chapter 1. Introduction
-
Chapter 2. Lower Bounds (Complexity)
-
Chapter 3. Greedy Method
-
chapter 4 divide_and_conquer
-
Chapter 5.Searching Method (Branch-&-Bound Strategy)
-
Chapter 6. Prune-&-Search Strategy
-
Chapter 7. Dynamic Programming Strategy
-
Chapter 8. Np-complete
-
optimal binary search tree 範例
- 課程介紹
- 課程安排
- 評論