“2013级--学期安排 (第二学期)”的版本间的差异
来自问题求解
(→学习周历) |
(→学习周历) |
||
(未显示1个用户的5个中间版本) | |||
第34行: | 第34行: | ||
<tr> | <tr> | ||
<td>2.18--2.22</td> | <td>2.18--2.22</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/index.php/%E6%96%87%E4%BB%B6:2014-2-18.pdf 2-1:算法方法]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第63行: | 第63行: | ||
<tr> | <tr> | ||
<td>2.25--3.1</td> | <td>2.25--3.1</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/index.php/%E6%96%87%E4%BB%B6:2014-02-25.pdf 2-2:算法正确性]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第93行: | 第93行: | ||
<tr> | <tr> | ||
<td>3.4--3.8</td> | <td>3.4--3.8</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/images/f/f0/%E7%AE%97%E6%B3%95%E7%9A%84%E6%95%88%E7%8E%872014-03-04.pdf 2-3:算法的效率]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第123行: | 第123行: | ||
<tr> | <tr> | ||
<td>3.11--3.15</td> | <td>3.11--3.15</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/index.php/%E6%96%87%E4%BB%B6:2014-03-11.pdf 2-4:算法问题与解题的算法]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第155行: | 第155行: | ||
<tr> | <tr> | ||
<td>3.18--3.28</td> | <td>3.18--3.28</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/index.php/%E6%96%87%E4%BB%B6:%E7%BB%84%E5%90%88%E4%B8%8E%E8%AE%A1%E6%95%B02014-03-18.pdf 2-5:组合与计数]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第187行: | 第187行: | ||
<tr> | <tr> | ||
<td>3.31--4.11</td> | <td>3.31--4.11</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/images/2/29/%E5%88%86%E6%B2%BB%E6%B3%95%E4%B8%8E%E9%80%92%E5%BD%922014-04-01.pdf 2-6:分治法与递归]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第221行: | 第221行: | ||
<tr> | <tr> | ||
<td>4.14--4.18</td> | <td>4.14--4.18</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/images/0/0b/%E9%80%92%E5%BD%92%E5%8F%8A%E5%85%B6%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%802014-04-15.pdf 2-7:递归及其数学基础]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第256行: | 第256行: | ||
<tr> | <tr> | ||
<td>4.21--4.30</td> | <td>4.21--4.30</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/images/8/88/%E7%A6%BB%E6%95%A3%E6%A6%82%E7%8E%87%E5%9F%BA%E7%A1%801.pdf 2-8:离散概率基础-1]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第289行: | 第289行: | ||
<tr> | <tr> | ||
<td>5.5--5.9</td> | <td>5.5--5.9</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/images/1/1f/%E6%A6%82%E7%8E%87%E5%88%86%E6%9E%90%E4%B8%8E%E9%9A%8F%E6%9C%BA%E7%AE%97%E6%B3%952014-05-06.pdf 2-9:概率分析与随机算法]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第323行: | 第323行: | ||
</tr> | </tr> | ||
<tr> | <tr> | ||
− | <td> | + | <td>5.13--5.23</td> |
− | <td>2-10:排序与选择</td> | + | <td>[http://114.212.10.6/problem_solving/images/6/66/SortAndSelection.pdf 2-10:排序与选择]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第365行: | 第365行: | ||
</tr> | </tr> | ||
<tr> | <tr> | ||
− | <td> | + | <td>5.26--5.30</td> |
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/index.php/%E6%96%87%E4%BB%B6:2-11%E5%9F%BA%E6%9C%AC%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84.pdf 2-11:基本数据结构]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第399行: | 第399行: | ||
<tr> | <tr> | ||
<td>5.6--5.10</td> | <td>5.6--5.10</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/index.php/%E6%96%87%E4%BB%B6:%E8%AE%A1%E7%AE%97%E6%9C%BA%E9%97%AE%E9%A2%98%E6%B1%82%E8%A7%A3-2013-04-23.pdf 2-12:堆与堆排序]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第434行: | 第434行: | ||
<tr> | <tr> | ||
<td>5.13--5.17</td> | <td>5.13--5.17</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/index.php/%E6%96%87%E4%BB%B6:%E8%AE%A1%E7%AE%97%E6%9C%BA%E9%97%AE%E9%A2%98%E6%B1%82%E8%A7%A3-2013-04-30.pdf 2-13:Hashing方法]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第468行: | 第468行: | ||
<tr> | <tr> | ||
<td>5.20--5.24</td> | <td>5.20--5.24</td> | ||
− | <td>[http:// | + | <td>[http://114.212.10.6/problem_solving/index.php/%E6%96%87%E4%BB%B6:%E8%AE%A1%E7%AE%97%E6%9C%BA%E9%97%AE%E9%A2%98%E6%B1%82%E8%A7%A3-2013-05-06.pdf 2-14:搜索树]</td> |
<td> | <td> | ||
<ul> | <ul> | ||
第502行: | 第502行: | ||
</td> | </td> | ||
</tr> | </tr> | ||
− | + | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
</table> | </table> |
2016年3月14日 (一) 09:20的最新版本
基本要求
- 理解数据抽象,理解并能够应用常用的数据结构。
- 掌握重要算法设计策略以及算法设计与分析的基本方法。
- 理解并能够应用支持上述内容的离散数学工具与方法。
注意:程序设计能力要求贯穿于整个课程,不再单列。
指定教材
- CS: Cliff Stein et al.: Discrete Mathematics for Computer Scientists, 1st ed. Addison-Wesley, 2010
- DW: Douglas West: Introduction to Graph Theory, 2nd ed. Pearson, 2000
- 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
- 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
学习周历
日期 | 论题 | 学习目的 | 阅读材料 | 引导要点 | 书面作业 | 编程任务 |
---|---|---|---|---|---|---|
2.18--2.22 | 2-1:算法方法 |
|
|
|
|
|
2.25--3.1 | 2-2:算法正确性 |
|
|
|
|
|
3.4--3.8 | 2-3:算法的效率 |
|
|
|
|
|
3.11--3.15 | 2-4:算法问题与解题的算法 |
|
|
|
|
|
3.18--3.28 | 2-5:组合与计数 |
|
|
|
|
|
3.31--4.11 | 2-6:分治法与递归 |
|
|
|
|
|
4.14--4.18 | 2-7:递归及其数学基础 |
|
|
|
|
|
4.21--4.30 | 2-8:离散概率基础-1 |
|
|
|
|
|
5.5--5.9 | 2-9:概率分析与随机算法 |
|
|
|
|
|
5.13--5.23 | 2-10:排序与选择 |
|
|
|
|
|
5.26--5.30 | 2-11:基本数据结构 |
|
|
|
|
|
5.6--5.10 | 2-12:堆与堆排序 |
|
|
|
|
|
5.13--5.17 | 2-13:Hashing方法 |
|
|
|
|
|
5.20--5.24 | 2-14:搜索树 |
|
|
|
|
|