“2019级--学期安排 (第二学期)”的版本间的差异
来自问题求解
(→学习周历) |
|||
第1行: | 第1行: | ||
+ | == 基本要求 == | ||
+ | |||
+ | * 理解数据抽象,理解并能够应用常用的数据结构 | ||
+ | * 掌握重要算法设计策略以及算法分析的基本方法 | ||
+ | * 理解并能够应用支持上述内容的离散数学工具与方法 | ||
+ | * 程序设计能力 | ||
+ | |||
+ | == 考核方法 (待定)== | ||
+ | |||
+ | 所有形式的考核,均不准抄袭。 | ||
+ | |||
+ | [[Media:2017-2-final-exam.pdf | 2017-2-final-exam.pdf]] ([[Media:2017-2-final-exam-src.zip | 2017-2-final-exam-src.zip]]) | ||
+ | |||
+ | == 指定教材 == | ||
+ | |||
+ | * '''DH''': David Harel et al.: [[Media:Algorithmics-the_Spirit_of_Computing,_3rd_by_David_Harel.pdf | Algorithmics - The Spirit of Computing]], 3rd ed. Addison-Wesley, 2004 | ||
+ | * '''CS''': Clifford Stein et al.: [[Media:Discrete_Mathematics_for_Computer_Scientists.pdf | Discrete Mathematics for Computer Scientists]], 1st ed. Addison-Wesley, 2010 | ||
+ | * '''TC''': Thomas Cormen et al.: [[Media:CLRS_Introduction_to_Algorithms_(3rd_Edition,_2009).pdf | Introduction to Algorithms]], 3rd ed. MIT, 2009 | ||
+ | * '''MA''': Manoochehr Azmoodeh. [[Media:Abstract_Data_Types_and_Algorithms,_by_Manoochehr_Azmoodeh.pdf | Abstract Data Types and Algorithms]], Macmillan Education, UK, 1990 | ||
+ | * '''SB''': Sara Baase et al.: [[Media:SB_-_Computer_Algorithms_-_Introduction_to_Design_and_Analysis_(3rd).pdf | Computer Algorithms - Introduction to Design and Analysis]], 3rd ed. Addison-Wesley, 1999 (第2章:抽象数据类型) | ||
+ | |||
+ | == 推荐课外阅读材料 == | ||
+ | '''''(可参照习题课扩展材料部分所给出的阅读建议)''''' | ||
+ | |||
+ | * Kenneth H. Rosen: [[Media:Discrete_Mathematics_and_Its_Applications_(7th_Edition).pdf | Discrete Mathematics and Its Applications]], 7th Edition. McGraw-Hill, 2011 | ||
+ | |||
+ | * Donald E. Knuth: [[Media:The_Art_of_Computer_Programmin_Volume4A_Combinatorial_Algorithms.pdf | The Art of Computer Programming Vol4A: Combinatorial Algorithms Part 1]], 2011 | ||
+ | |||
+ | * Ronald L. Graham, Donald E. Knuth, Oren Patashnik: [[Media: Concrete_Mathematics_-_R._Graham,_D._Knuth,_O._Patashnik.pdf | Concrete Mathematics: A Foundation for Computer Science]], 2nd Edition, 1994. | ||
+ | |||
+ | * Jon Bentley: [[Media:Programming_Pearls_(Second_Edition_Jon_Bentley).pdf | Programming Pearls]], 2nd Edition, 1999. | ||
+ | |||
+ | * Robert Sedgewick, Philippe Flajolet: [[Media:An_Introduction_to_the_Analysis_of_Algorithms_(2nd_Edition_Robert_Sedgewick,_Philippe_Flajolet).pdf | Book: An Introduction to the Analysis of Algorithms]], 2nd Edition, 2012. | ||
+ | |||
+ | * Martin Aigner: [[Media:Proofs_from_THE_BOOK_(Fifth_Edition_2014).pdf | Book: Proofs from THE BOOK]], Fifth Edition, 2014. | ||
+ | |||
+ | 更多阅读材料将随课堂进度添加。 | ||
== 学习周历 == | == 学习周历 == | ||
2020年2月10日 (一) 11:09的版本
基本要求
- 理解数据抽象,理解并能够应用常用的数据结构
- 掌握重要算法设计策略以及算法分析的基本方法
- 理解并能够应用支持上述内容的离散数学工具与方法
- 程序设计能力
考核方法 (待定)
所有形式的考核,均不准抄袭。
2017-2-final-exam.pdf ( 2017-2-final-exam-src.zip)
指定教材
- DH: David Harel et al.: Algorithmics - The Spirit of Computing, 3rd ed. Addison-Wesley, 2004
- CS: Clifford Stein et al.: Discrete Mathematics for Computer Scientists, 1st ed. Addison-Wesley, 2010
- TC: Thomas Cormen et al.: Introduction to Algorithms, 3rd ed. MIT, 2009
- MA: Manoochehr Azmoodeh. Abstract Data Types and Algorithms, Macmillan Education, UK, 1990
- SB: Sara Baase et al.: Computer Algorithms - Introduction to Design and Analysis, 3rd ed. Addison-Wesley, 1999 (第2章:抽象数据类型)
推荐课外阅读材料
(可参照习题课扩展材料部分所给出的阅读建议)
- Kenneth H. Rosen: Discrete Mathematics and Its Applications, 7th Edition. McGraw-Hill, 2011
- Donald E. Knuth: The Art of Computer Programming Vol4A: Combinatorial Algorithms Part 1, 2011
- Ronald L. Graham, Donald E. Knuth, Oren Patashnik: Concrete Mathematics: A Foundation for Computer Science, 2nd Edition, 1994.
- Jon Bentley: Programming Pearls, 2nd Edition, 1999.
- Robert Sedgewick, Philippe Flajolet: Book: An Introduction to the Analysis of Algorithms, 2nd Edition, 2012.
- Martin Aigner: Book: Proofs from THE BOOK, Fifth Edition, 2014.
更多阅读材料将随课堂进度添加。
学习周历
日期 | 论题 | 学习目的 | 阅读材料 | 引导要点 | 书面作业 | Open Topics |
---|---|---|---|---|---|---|
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|
||
2019-xx-xx |
|
|
|
|