“2019级--小班讨论 (第一学期)”的版本间的差异
来自问题求解
(→学习周历) |
(→学习周历) |
||
第6行: | 第6行: | ||
! 论题 | ! 论题 | ||
! Open Topics | ! Open Topics | ||
− | |||
− | |||
! 扩展材料 | ! 扩展材料 | ||
(供感兴趣的同学自学使用) | (供感兴趣的同学自学使用) | ||
第14行: | 第12行: | ||
| | | | ||
1-1-why | 1-1-why | ||
− | |||
| | | | ||
* 假币问题 | * 假币问题 | ||
− | |||
− | |||
* 汉诺塔问题 | * 汉诺塔问题 | ||
− | |||
− | |||
| | | | ||
* [[Media:Counterfeit Coin Problems (MAA 1977).pdf | Counterfeit Coin Problems (1977)]] | * [[Media:Counterfeit Coin Problems (MAA 1977).pdf | Counterfeit Coin Problems (1977)]] | ||
第28行: | 第21行: | ||
| 2019-10-17 | | 2019-10-17 | ||
| 1-2-reasoning | | 1-2-reasoning | ||
− | |||
| | | | ||
* 命题逻辑的自然推理系统 + Coq | * 命题逻辑的自然推理系统 + Coq | ||
− | |||
− | |||
* 前束范式 | * 前束范式 | ||
− | |||
− | |||
| | | | ||
|- | |- | ||
| 2019-10-24 | | 2019-10-24 | ||
| 1-3-proof | | 1-3-proof | ||
− | |||
− | |||
| | | | ||
* Induction + Coq | * Induction + Coq | ||
− | |||
− | |||
* Double Counting | * Double Counting | ||
− | |||
− | |||
| | | | ||
* Chapter 30 ``Cayley's formula for the number of trees'' of ``Proofs from THE BOOK'' (Fourth Edition) | * Chapter 30 ``Cayley's formula for the number of trees'' of ``Proofs from THE BOOK'' (Fourth Edition) | ||
第56行: | 第38行: | ||
| 2019-10-31 | | 2019-10-31 | ||
| 1-4-algorithm | | 1-4-algorithm | ||
− | |||
− | |||
| | | | ||
* 尾递归 | * 尾递归 | ||
− | |||
− | |||
* 结构化程序设计 | * 结构化程序设计 | ||
− | |||
− | |||
| | | | ||
|- | |- | ||
| 2019-11-07 | | 2019-11-07 | ||
| 1-5-data-structure | | 1-5-data-structure | ||
− | |||
− | |||
| | | | ||
* Pointers and Arrays | * Pointers and Arrays | ||
− | |||
− | |||
* Sequential Containers in C++ STL | * Sequential Containers in C++ STL | ||
− | |||
− | |||
| | | | ||
* [https://plato.stanford.edu/entries/recursive-functions/ Recursive Functions] | * [https://plato.stanford.edu/entries/recursive-functions/ Recursive Functions] | ||
第84行: | 第54行: | ||
| 2019-11-14 | | 2019-11-14 | ||
| 1-6-programming-language | | 1-6-programming-language | ||
− | |||
− | |||
| | | | ||
* 正则表达式 | * 正则表达式 | ||
− | |||
− | |||
* 程序设计语言的语义 | * 程序设计语言的语义 | ||
− | |||
− | |||
| | | | ||
* "The Art of Computer Programming" (Vol 4A) by Donald Knuth | * "The Art of Computer Programming" (Vol 4A) by Donald Knuth | ||
第99行: | 第63行: | ||
| 2019-11-21 | | 2019-11-21 | ||
| 1-7-programming-paradigm | | 1-7-programming-paradigm | ||
− | |||
− | |||
− | |||
| | | | ||
* 高阶函数 | * 高阶函数 | ||
第115行: | 第76行: | ||
| 2019-11-28 | | 2019-11-28 | ||
| 1-8-set | | 1-8-set | ||
− | |||
− | |||
| | | | ||
* 集合表示自然数 | * 集合表示自然数 | ||
− | |||
− | |||
* 选择公理 | * 选择公理 | ||
− | |||
− | |||
| | | | ||
* [https://book.douban.com/subject/1248211/ 《选择公理》,作者:赵希顺] | * [https://book.douban.com/subject/1248211/ 《选择公理》,作者:赵希顺] | ||
第129行: | 第84行: | ||
| 2019-12-05 | | 2019-12-05 | ||
| 1-9-relation | | 1-9-relation | ||
− | |||
− | |||
| | | | ||
* 关系 | * 关系 | ||
− | |||
− | |||
* 实数理论 | * 实数理论 | ||
− | |||
− | |||
| | | | ||
|- | |- | ||
| 2019-12-12 | | 2019-12-12 | ||
| 1-10-function | | 1-10-function | ||
− | |||
− | |||
| | | | ||
* Lambda 演算 | * Lambda 演算 | ||
− | |||
− | |||
* 递归函数论 | * 递归函数论 | ||
− | |||
− | |||
| | | | ||
|- | |- | ||
| 2019-12-19 | | 2019-12-19 | ||
| 1-11-infinity | | 1-11-infinity | ||
− | |||
− | |||
| | | | ||
* 基数 | * 基数 | ||
− | + | ||
− | |||
* 序数 | * 序数 | ||
− | |||
− | |||
| | | | ||
|- | |- | ||
| 2019-12-26 | | 2019-12-26 | ||
| 复习 | | 复习 | ||
− | |||
− | |||
| | | | ||
* Dilworth's Theorem | * Dilworth's Theorem | ||
− | |||
− | |||
* Lattice of Stable Matchings | * Lattice of Stable Matchings | ||
− | |||
− | |||
| | | | ||
|} | |} |
2021年9月13日 (一) 14:16的版本
学习周历
日期 | 论题 | Open Topics | 扩展材料
(供感兴趣的同学自学使用) |
---|---|---|---|
2019-10-10 |
1-1-why |
|
理解解题思路,完善解题细节 |
2019-10-17 | 1-2-reasoning |
|
|
2019-10-24 | 1-3-proof |
|
再体会一下"Double Counting"的神奇之处。一开始会觉得困难,但当你一旦理解了,事情就变得非常简单而优雅。
|
2019-10-31 | 1-4-algorithm |
|
|
2019-11-07 | 1-5-data-structure |
|
递归函数论。感受可计算性的概念。思考 Bounded Iteration 与 Unbounded Iteration 的本质区别。 |
2019-11-14 | 1-6-programming-language |
|
Section 7.2.1.2 for "Generating All Permutations" |
2019-11-21 | 1-7-programming-paradigm |
|
Section 2.2.1 for "Stackable/Queueable Permutations" |
2019-11-28 | 1-8-set |
|
|
2019-12-05 | 1-9-relation |
|
|
2019-12-12 | 1-10-function |
|
|
2019-12-19 | 1-11-infinity |
|
|
2019-12-26 | 复习 |
|