2015级--学期安排 (第二学期)
来自问题求解
基本要求
- 理解数据抽象,理解并能够应用常用的数据结构。
- 掌握重要算法设计策略以及算法设计与分析的基本方法。
- 理解并能够应用支持上述内容的离散数学工具与方法。
注意:程序设计能力要求贯穿于整个课程,不再单列。
指定教材
- CS: Cliff Stein et al.: Discrete Mathematics for Computer Scientists, 1st ed. Addison-Wesley, 2010
- DH: David Harel et al.: Algorithmics - The Spirit of Computing, 3rd ed. Addison-Wesley, 2004
- DW: Douglas West: Introduction to Graph Theory, 2nd ed. Pearson, 2000
- ES: Edward Scheinerman: Mathematics - A Discrete Introduction, 2nd ed. Brooks/Cole, 2005 (第24节:鸽巢原理)
- JH: Juraj Hromkovic: Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, 2nd ed. Springer, 2002
- SB: Sara Baase et al.: Computer Algorithms - Introduction to Design and Analysis, 3rd ed. Addison-Wesley, 1999 (第2章:抽象数据类型)
- TC: Thomas Cormen: Introduction to Algorithms, 3rd ed. MIT, 2009
- TJ: Thomas Judson: Abstract Algebra - Theory and Applications, http://abstract.ups.edu/
- UD: Ulrich Daepp et al.: Reading, Writing, and Proving - A Closer Look at Mathematics, 1st ed. Springer, 2003
- WS: Walter Savitch: Problem Solving with C++, 7th ed. Addison Wesley, 2008
推荐课外读物
- Kenneth H. Rosen: Discrete Mathematics and Its Applications, 7th ed. McGraw-Hill, 2011
学习周历
日期 | 论题 | 学习目的 | 阅读材料 | 引导要点 | 书面作业 | 编程任务 |
---|---|---|---|---|---|---|
2016-02-25 | 2-1:算法方法 |
|
|
|
|
|
2016-03-03 | 2-2:算法正确性 |
|
|
|
|
|
2016-03-10 | [1] |
|
|
|
|
|
[2-4:组合与计数] |
|
|
|
|
|
|
[2-5:分治法与递归] |
|
|
|
|
|
|
[2-6:递归及其数学基础] |
|
|
|
|
|
|
[2-7:离散概率基础-1] |
|
|
|
|
|
|
[2-8:概率分析与随机算法] |
|
|
|
|
|
|
[2-9:排序与选择] |
|
|
|
|
|
|
[2-10:基本数据结构] |
|
|
|
|
|
|
[2-11:堆与堆排序] |
|
|
|
|
|
|
[2-12:Hashing方法] |
|
|
|
|
|
|
[2-13:搜索树] |
|
|
|
|
|