This course introduces techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: Randomized algorithms, Divide-and-Conquer; Greedy method, Dynamic programming, Backtracking, Branch-and-bound; graph algorithms; NP-complete problems. The aim of this course is to have a more detailed study of efficient algorithms for computational problems.

2.教學大綱:
配合台灣師範大學演算法開課之課綱增修至少包含
	Introduction
	Lower Bounds (Complexity)
	Greedy Method
	Divide-&-Conquer Strategy
	Searching Method (Branch-&-Bound Strategy)
	Prune-&-Search Strategy
	Dynamic Programming Strategy
 通过条件
成  绩:60 分
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
  • undefined
授课老师
丁德榮
推荐课程
  • 开课期间:2019-08-01~2020-01-31
    LINE分享功能只支援行动装置
  • 开课期间:2018-02-01~2018-06-30
    LINE分享功能只支援行动装置
  • 开课期间:2016-02-01~2016-07-31
    LINE分享功能只支援行动装置
  • 开课期间:2013-08-01~2014-01-31
    LINE分享功能只支援行动装置
  • 开课期间:2012-02-06~2012-07-31
    LINE分享功能只支援行动装置


LINE分享功能只支援行动装置