“2019级--小班讨论 (第一学期)”的版本间的差异
来自问题求解
(→学习周历) |
|||
第6行: | 第6行: | ||
! 论题 | ! 论题 | ||
! Open Topics | ! Open Topics | ||
+ | * 1: 227(马) | ||
+ | * 2: 228 (魏)) | ||
! 扩展材料 | ! 扩展材料 | ||
(供感兴趣的同学自学使用) | (供感兴趣的同学自学使用) | ||
第12行: | 第14行: | ||
| | | | ||
1-1-why | 1-1-why | ||
+ | * [[Media:1-1-why-scan.pdf | 1-1-why-扫描版 (魏)]] | ||
| | | | ||
* 假币问题 | * 假币问题 | ||
+ | # [[Media:1-1-Coin-高灏.pptx | 高灏]] | ||
+ | # [[Media:1-1-Coin-戴一帆.pptx | 戴一帆]] | ||
* 汉诺塔问题 | * 汉诺塔问题 | ||
+ | # [[Media:1-1-Hanoi-林海波.pptx | 林海波]] | ||
+ | # [[Media:1-1-Hanoi-朱宇博.zip | 朱宇博]] | ||
| | | | ||
* [[Media:Counterfeit Coin Problems (MAA 1977).pdf | Counterfeit Coin Problems (1977)]] | * [[Media:Counterfeit Coin Problems (MAA 1977).pdf | Counterfeit Coin Problems (1977)]] | ||
第21行: | 第28行: | ||
| 2019-10-17 | | 2019-10-17 | ||
| 1-2-reasoning | | 1-2-reasoning | ||
+ | * [[Media:1-2-reasoning-scan.pdf | 1-2-reasoning-扫描版 (魏)]] | ||
| | | | ||
* 命题逻辑的自然推理系统 + Coq | * 命题逻辑的自然推理系统 + Coq | ||
+ | # [[Media:1-2-Natural-陈弘毅.pptx | 陈弘毅]] | ||
+ | # [[Media:1-2-Natural-吴煜青.zip | 吴煜青]] | ||
* 前束范式 | * 前束范式 | ||
+ | # [[Media:1-2-PNF-贾林杰.pptx | 贾林杰]] | ||
+ | # [[Media:1-2-PNF-张浩宇.zip | 张浩宇]] | ||
| | | | ||
|- | |- | ||
| 2019-10-24 | | 2019-10-24 | ||
| 1-3-proof | | 1-3-proof | ||
+ | * [[Media:1-2-reasoning.pdf | 1-2-reasoning.pdf (魏)]] | ||
+ | * [[Media:1-2-reasoning-handout.pdf | 1-2-reasoning-handout.pdf (魏)]] | ||
| | | | ||
* Induction + Coq | * Induction + Coq | ||
+ | # [[Media:1-3-CoqInduction-李晗.zip | 李晗]] | ||
+ | # [[Media:1-3-CoqInduction-曹恒源.zip | 曹恒源]] | ||
* Double Counting | * Double Counting | ||
+ | # [[Media:1-3-CoutingTrees-浦亮.pptx | 浦亮]] | ||
+ | # [[Media:1-3-CountingTrees-周晓.pptx | 周晓]] | ||
| | | | ||
* 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) | ||
第38行: | 第56行: | ||
| 2019-10-31 | | 2019-10-31 | ||
| 1-4-algorithm | | 1-4-algorithm | ||
+ | * [[Media:2019-1-3-proof.pdf | 1-3-proof.pdf (魏)]] | ||
+ | * [[Media:2019-1-3-proof-handout.pdf | 1-3-proof-handout.pdf (魏)]] | ||
| | | | ||
* 尾递归 | * 尾递归 | ||
+ | # [[Media:1-4-TailRecursion-姚梦雨.pptx | 姚梦雨]] | ||
+ | # [[Media:1-4-TailRecursion-刘闵.pptx | 刘闵]] | ||
* 结构化程序设计 | * 结构化程序设计 | ||
+ | # [[Media:1-4-SP-彭泽.pptx | 彭泽]] | ||
+ | # [[Media:1-4-SP-马文洁.zip | 马文洁]] | ||
| | | | ||
|- | |- | ||
| 2019-11-07 | | 2019-11-07 | ||
| 1-5-data-structure | | 1-5-data-structure | ||
+ | * [[Media:2019-1-4-algorithm.pdf | 1-4-algorithm.pdf (魏)]] | ||
+ | * [[Media:2019-1-4-algorithm-handout.pdf | 1-4-algorithm-handout.pdf (魏)]] | ||
| | | | ||
* Pointers and Arrays | * Pointers and Arrays | ||
+ | # [[Media:2019-1-5-Pointer-诸高骅.zip | 诸高骅]] | ||
+ | # [[Media:2019-1-5-Pointer-严泽宇.pptx | 严泽宇]] | ||
* Sequential Containers in C++ STL | * Sequential Containers in C++ STL | ||
+ | # [[Media:2019-1-5-STL-黄泽雨.pptx | 黄泽雨]] | ||
+ | # [[Media:2019-1-5-STL-曹雨森.pptx | 曹雨森]] | ||
| | | | ||
* [https://plato.stanford.edu/entries/recursive-functions/ Recursive Functions] | * [https://plato.stanford.edu/entries/recursive-functions/ Recursive Functions] | ||
第54行: | 第84行: | ||
| 2019-11-14 | | 2019-11-14 | ||
| 1-6-programming-language | | 1-6-programming-language | ||
+ | * [[Media:2019-1-5-data-structure-I.pdf | 1-5-data-structure-I.pdf (魏)]] | ||
+ | * [[Media:2019-1-5-data-structure-I-handout.pdf | 1-5-data-structure-I-handout.pdf (魏)]] | ||
| | | | ||
* 正则表达式 | * 正则表达式 | ||
+ | # 王子鉴 | ||
+ | # [[Media:2019-1-6-RE-吴煜青.pptx |吴煜青]] | ||
* 程序设计语言的语义 | * 程序设计语言的语义 | ||
+ | # [[Media:2019-1-6-Hoare-张涛.zip | 张涛]] | ||
+ | # [[Media:2019-1-6-Hoare-乔志鹏.zip | 乔志鹏]] | ||
| | | | ||
* "The Art of Computer Programming" (Vol 4A) by Donald Knuth | * "The Art of Computer Programming" (Vol 4A) by Donald Knuth | ||
第63行: | 第99行: | ||
| 2019-11-21 | | 2019-11-21 | ||
| 1-7-programming-paradigm | | 1-7-programming-paradigm | ||
+ | * [[Media:2019-1-5-data-structure-II.pdf | 1-5-data-structure-II.pdf (魏)]] | ||
+ | * [[Media:2019-1-5-data-structure-II-handout.pdf | 1-5-data-structure-II-handout.pdf (魏)]] | ||
+ | * [[Media:2019-1-6-programming-language.pdf | 1-6-programming-language.pdf (魏)]] | ||
| | | | ||
* 高阶函数 | * 高阶函数 | ||
第76行: | 第115行: | ||
| 2019-11-28 | | 2019-11-28 | ||
| 1-8-set | | 1-8-set | ||
+ | * [[Media:2019-1-8-set-problem.pdf | 2019-1-8-set.pdf (魏)]] | ||
+ | * [[Media:2019-1-8-set-problem-handout.pdf | 2019-1-8-set-handout.pdf (魏)]] | ||
| | | | ||
* 集合表示自然数 | * 集合表示自然数 | ||
+ | # [[Media:2019-1-8-NaturalNumber-赵超懿.pptx | 赵超懿]] | ||
+ | # [[Media:2019-1-8-NaturalNumber-屈力.pptx | 屈力]] | ||
* 选择公理 | * 选择公理 | ||
+ | # [[Media:2019-1-8-Choice-马传龙.pptx | 马传龙]] | ||
+ | # [[Media:2019-1-8-Choice-马成功.pptx | 马成功]] | ||
| | | | ||
* [https://book.douban.com/subject/1248211/ 《选择公理》,作者:赵希顺] | * [https://book.douban.com/subject/1248211/ 《选择公理》,作者:赵希顺] | ||
第84行: | 第129行: | ||
| 2019-12-05 | | 2019-12-05 | ||
| 1-9-relation | | 1-9-relation | ||
+ | * [[Media:2019-1-9-relation-problem.pdf | 2019-1-9-relation.pdf (魏)]] | ||
+ | * [[Media:2019-1-9-relation-problem-handout.pdf | 2019-1-9-relation-handout.pdf (魏)]] | ||
| | | | ||
* 关系 | * 关系 | ||
+ | # [[Media: | 陈驰]] | ||
+ | # [[Media:2019-1-9-Relation-孙伟杰.pptx | 孙伟杰]] | ||
* 实数理论 | * 实数理论 | ||
+ | # [[Media: | 曹蔚宁]] | ||
+ | # [[Media:2019-1-9-Real-毛子钰.pptx | 毛子钰]] | ||
| | | | ||
|- | |- | ||
| 2019-12-12 | | 2019-12-12 | ||
| 1-10-function | | 1-10-function | ||
+ | * [[Media:2019-1-10-function-problem.pdf | 2019-1-10-function.pdf (魏)]] | ||
+ | * [[Media:2019-1-10-function-problem-handout.pdf | 2019-1-10-function-handout.pdf (魏)]] | ||
| | | | ||
* Lambda 演算 | * Lambda 演算 | ||
+ | # [[Media: | 金前程]] | ||
+ | # [[Media:2019-1-10-Lambda-李松原.pptx | 李松原]] [[Media: | 马文洁]] | ||
* 递归函数论 | * 递归函数论 | ||
+ | # [[Media:2019-1-10 recursive functions 郝博强.pptx | 郝博强]] | ||
+ | # [[Media:2019-1-10-Recursive-林荣恩.pdf | 林荣恩]] | ||
| | | | ||
|- | |- | ||
| 2019-12-19 | | 2019-12-19 | ||
| 1-11-infinity | | 1-11-infinity | ||
+ | * [[Media:2019-1-11-infinity-problem.pdf | 2019-1-11-infinity.pdf (魏)]] | ||
+ | * [[Media:2019-1-11-infinity-problem-handout.pdf | 2019-1-11-infinity-handout.pdf (魏)]] | ||
| | | | ||
* 基数 | * 基数 | ||
− | + | # [[Media:2019-1-11-Cardinal-宋天惠.pptx | 宋天惠]] | |
+ | # [[Media:2019-1-11-Cardinal-王康浩.zip | 王康浩]] | ||
* 序数 | * 序数 | ||
+ | # [[Media:2019-1-11-Ordinal--方宇航.pptx | 方宇航]] | ||
+ | # [[Media:2019-1-11-Ordinal--史丰萁.zip | 史丰萁]] | ||
| | | | ||
|- | |- | ||
| 2019-12-26 | | 2019-12-26 | ||
| 复习 | | 复习 | ||
+ | * [[Media:2017-1-exam.pdf | 2017-1-exam.pdf (魏)]] | ||
+ | * [[Media:2017-1-exam-handout.pdf | 2017-1-exam-handout.pdf (魏)]] | ||
| | | | ||
* Dilworth's Theorem | * Dilworth's Theorem | ||
+ | # [[Media:2019-1-12-Dilworth-徐一鸣.zip | 徐一鸣]] | ||
+ | # [[Media:2019-1-12-Dilworth-蒋晟.pptx | 蒋晟]] | ||
* Lattice of Stable Matchings | * Lattice of Stable Matchings | ||
+ | # [[Media:2019-1-12-StableMatchingLattice-刘嘉诚.zip | 刘嘉诚]] | ||
+ | # [[Media:2019-1-12-Stable MatchingLattice-胡涛.pptx | 胡涛]] | ||
| | | | ||
|} | |} |
2021年9月13日 (一) 14:19的版本
学习周历
日期 | 论题 | 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 | 复习 |
|