本课程对象以对利用计算机来解决问题有兴趣的同学为主.ppt

演算法 (Algorithms ) 內容: 本課程對象以對利用計算機來解決問題有興趣的同學為主。本課程主要是教授基本的演算法分析與設計技巧，並整理及比較目前最重要之演算法。 Theme: What is the best algorithm for a given problem Three things you will learn: Design a good algorithm Analyze (and verify) it Lower bounds: know when to stop. Grading 作業, Term Project (20-25 %) 期中考 (35-40%) 期末考 (40%) Course Information Instructor:顏嗣鈞 E-mail: yen@.tw Office: Rm. BL-525 Phone: 3366 3581 .tw/~yen Office Hours: by appointment Teaching Assistant(s): to be announced later Web site: .tw/~yen/courses/algorithms06.html Textbook T. Cormen, C. Leiserson, R. Rivest, and C. Stein Introduction to Algorithms, 2nd Ed. MIT Press and McGraw-Hill Book Company, 2001 Reference Books Anany Levitin Introduction to The Design Analysis of Algorithms. Addison-Wesley , 2002 Reference Books J. Kleinberg, E. Tardos. Algorithm Design. Addison-Wesley, 2005. Reference Books G. Brassard and P. Bratley, Fundamentals of Algorithmics, Prentice-Hall, 1996. Reference Books G. Rawlins, Compare to What? An Introduction to the Analysis of Algorithms, Computer Science Press, 1992. Reference Books D. E. Knuth, The Art of Computer Programming, Vol. 1 and 3, Third Edition, Addison Wesley, 1997. Reference Books D. Harel, The Science of Computing, Addison Wesley, 1987. Reference Books Robert Sedgewick, Algorithms (in C, C++, Pascal), Second Edition, Addison Wesley, 1992 Reference Books U. Manber, Introduction to Algorithms, Addison Wesley, 1989. Reference Books J. Nievergelt, Algorithms and Data Structures (With Applications to Graphics and Geometry), Prentice-Hall, 1993. Reference Books B. Moret and H. Shapiro, Algorithms from P to NP, Vol. 1, The Benjamin/Cummings Publishing Company, Inc., 1991. Life Cycle of Software Development Topics Techniques for algorithm design Divide and conquer, partitioning. Dynamic programming. Greedy algorithms. Backtracking. Tree based algorithms. Recursion. Approximations. Problem Transformation, reduction. Integer