“2022级--学期安排 (第三学期)”的版本间的差异
来自问题求解
(创建页面,内容为“==基本要求== <ul> <li>掌握典型应用中抽象出来的重要算法问题的求解方法。</li> <li>掌握复杂性理论的基本内容与问题规约...”) |
|||
第15行: | 第15行: | ||
<li>'''WS''': Walter Savitch: Problem Solving with C++, 7th ed. Addison Wesley, 2008</li> | <li>'''WS''': Walter Savitch: Problem Solving with C++, 7th ed. Addison Wesley, 2008</li> | ||
</ul> | </ul> | ||
+ | |||
+ | ==学习周历== | ||
+ | <table border="1px"> | ||
+ | <tr> | ||
+ | <th>日期</th> | ||
+ | <th>论题</th> | ||
+ | <th>阅读材料</th> | ||
+ | <th>周三小班</th> | ||
+ | <th>周四大班</th> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>9.4-9.8</td> | ||
+ | <td>3-1:图的基本概念</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>CHENG第1章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>9.11-9.15</td> | ||
+ | <td>3-2:连通和遍历</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>CHENG第2章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>9.18-9.22</td> | ||
+ | <td>3-3:圈和遍历</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>CHENG第3章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>9.25-9.29</td> | ||
+ | <td>3-4:连通度</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>CHENG第4章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>10.2-10.6</td> | ||
+ | <td>3-5:匹配</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>CHENG第5章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>10.9-10.13</td> | ||
+ | <td>3-6:单源最短路</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>CHENG第6.1节</li> | ||
+ | <li>TC第24章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>10.16-10.20</td> | ||
+ | <td>3-7:多源最短路</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第25章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>10.23-10.27</td> | ||
+ | <td>3-8:最小生成树</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>CHENG第6.2节</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>10.30-11.3</td> | ||
+ | <td>3-9:有向图</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>CHENG第7章</li> | ||
+ | <li>JH第3.2.1、3.2.3节</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>4.24-4.28</td> | ||
+ | <td>[[媒体文件:计算机问题求解-2022-10-堆与堆排序.pdf|2-10:堆与堆排序]]</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第6章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>5.1-5.5</td> | ||
+ | <td>[[媒体文件:计算机问题求解-2022-11-hashing方法.pdf|2-11:Hashing方法]]</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第11章</li> | ||
+ | <li>CS第5章第5节</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td>习题课</td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>5.8-5.12</td> | ||
+ | <td>[[媒体文件:计算机问题求解-2022-12-搜索树.pdf|2-12:搜索树]]</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第12、13章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>5.15-5.19</td> | ||
+ | <td>[[媒体文件:计算机问题求解-2022-13-动态规划.pdf|2-13:动态规划]]</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第15章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td>OT</td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>5.22-5.26</td> | ||
+ | <td>[[媒体文件:计算机问题求解-2022-14-贪心算法.pdf|2-14:贪心算法]]</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第16章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>5.29-6.2</td> | ||
+ | <td>[[媒体文件:计算机问题求解-2022-15-用于动态等价关系的数据结构.pdf|2-15:用于动态等价关系的数据结构与均摊分析]]</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第17章</li> | ||
+ | <li>TC第21章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td>OT</td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>6.5-6.9</td> | ||
+ | <td>[[媒体文件:计算机问题求解-2022-16-线性规划.pdf|2-16:线性规划]]</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第29章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td>习题课</td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>暑假自学</td> | ||
+ | <td>2-17:矩阵计算</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第28章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | <tr> | ||
+ | <td>暑假自学</td> | ||
+ | <td>2-18:串匹配</td> | ||
+ | <td> | ||
+ | <ul> | ||
+ | <li>TC第32章</li> | ||
+ | </ul> | ||
+ | </td> | ||
+ | <td></td> | ||
+ | <td></td> | ||
+ | </tr> | ||
+ | </table> |
2023年7月10日 (一) 13:57的版本
基本要求
- 掌握典型应用中抽象出来的重要算法问题的求解方法。
- 掌握复杂性理论的基本内容与问题规约方法。
- 理解解决“难”问题的主要方法、技术以及相关的重要理论。
注意:程序设计能力要求贯穿于整个课程,不再单列。
指定教材
- CHENG: 程龚: 图论与算法
- GC: Gary Chartrand et al.: Introduction to Graph Theory, 1st ed. McGraw-Hill, 2004
- TC: Thomas Cormen: Introduction to Algorithms, 3rd ed. MIT, 2009
- JH: Juraj Hromkovic: Algorithmics for Hard Problems - Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, 2nd ed. Springer, 2004
- WS: Walter Savitch: Problem Solving with C++, 7th ed. Addison Wesley, 2008
学习周历
日期 | 论题 | 阅读材料 | 周三小班 | 周四大班 |
---|---|---|---|---|
9.4-9.8 | 3-1:图的基本概念 |
|
||
9.11-9.15 | 3-2:连通和遍历 |
|
||
9.18-9.22 | 3-3:圈和遍历 |
|
||
9.25-9.29 | 3-4:连通度 |
|
||
10.2-10.6 | 3-5:匹配 |
|
||
10.9-10.13 | 3-6:单源最短路 |
|
||
10.16-10.20 | 3-7:多源最短路 |
|
||
10.23-10.27 | 3-8:最小生成树 |
|
||
10.30-11.3 | 3-9:有向图 |
|
||
4.24-4.28 | 2-10:堆与堆排序 |
|
||
5.1-5.5 | 2-11:Hashing方法 |
|
习题课 | |
5.8-5.12 | 2-12:搜索树 |
|
||
5.15-5.19 | 2-13:动态规划 |
|
OT | |
5.22-5.26 | 2-14:贪心算法 |
|
||
5.29-6.2 | 2-15:用于动态等价关系的数据结构与均摊分析 |
|
OT | |
6.5-6.9 | 2-16:线性规划 |
|
习题课 | |
暑假自学 | 2-17:矩阵计算 |
|
||
暑假自学 | 2-18:串匹配 |
|