2021级--学期安排（第二学期）
来自问题求解
基本要求
- 理解数据抽象，理解并能够应用常用的数据结构
- 掌握重要算法设计策略以及算法分析的基本方法
- 理解并能够应用支持上述内容的离散数学工具与方法
- 程序设计能力
考核方法
所有形式的考核,均不准抄袭。
| 考核形式 | 分值 |
|---|---|
| 作业 | 20 |
| OT | 10 |
| OJ | 15 |
| 机试 | 15 |
| 笔试 | 40 |
指定教材
- SM: Seymour Lipschutz and Marc Lipson: Theory and Problems of Discrete Mathematics, 3rd ed.
- 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
推荐课外阅读材料
(可参照习题课扩展材料部分所给出的阅读建议)
- Kenneth H. Rosen: Discrete Mathematics and Its Applications, 7th Edition. McGraw-Hill, 2011
- [TAOCP-4A] Donald E. Knuth: The Art of Computer Programming Vol4A: Combinatorial Algorithms Part 1, 2011
- [GKP] Ronald L. Graham, Donald E. Knuth, Oren Patashnik: Concrete Mathematics: A Foundation for Computer Science, 2nd Edition, 1994.
- [PP] Jon Bentley: Programming Pearls, 2nd Edition, 1999.
- [AoA] Robert Sedgewick, Philippe Flajolet: Book: An Introduction to the Analysis of Algorithms, 2nd Edition, 2012.
- [TheBook] Martin Aigner: Book: Proofs from THE BOOK, Fifth Edition, 2014.
- [MCS] Eric Lehman, F Thomson Leighton, Albert R Meyer: Mathematics for Computer Science, MIT, 2018.
更多阅读材料将随课堂进度添加。
学习周历
| 日期 | 论题 | 学习目的 | 阅读材料 | 引导要点 | 书面作业 | 编程作业 |
|---|---|---|---|---|---|---|
|
2022-02-16 |
|
|
|
| ||
| 2022-02-23 |
|
|
|
| ||
|
2022-03-02 |
|
|
|
| ||
|
2022-03-09 |
|
|
|
| ||
|
2022-03-16 |
|
|
|
| ||
|
2022-03-23 |
|
|
|
| ||
|
2022-03-30 |
|
|
|
| ||
|
2022-04-06 |
|
|
|
| ||
|
2022-04-13 |
|
|
|
| ||
|
2022-04-20 |
|
|
|
| ||
|
2022-04-27 |
|
|
|
| ||
|
2022-05-04 |
|
|
|
|
| |
|
2022-05-11 |
|
|
|
|
| |
|
2022-05-18 |
|
|
|
|
| |
|
2022-05-25 |
|
|
|
|
| |
|
2022-06-01 |
|
|
|
|
||
|
|
|
|
|
|
|
