“2021级--小班讨论 (第一学期)”的版本间的差异
来自问题求解
（→学习周历） |
（→学习周历） |
||
| （未显示同一用户的40个中间版本） | |||
| 第39行： | 第39行： | ||
| 2021-10-25 | | 2021-10-25 | ||
| 1-3-proof [[media:作业反馈1-3_.pptx|习题讲解]] | | 1-3-proof [[media:作业反馈1-3_.pptx|习题讲解]] | ||
| + | # [[media:2021-Permutation_Generation.pptx|排列生成]] | ||
| | | | ||
* Induction + Coq | * Induction + Coq | ||
| − | # [[ | + | # [[media:COQ中数学归纳法的使用-徐沐杰.pptx|徐木杰]]* |
| + | # [[media:如何在Coq中使用(王雷宇).pptx|王雷宇]] | ||
| + | # [[media:Coq李鸿毅_录像.pptx|李鸿毅]]* | ||
* Double Counting | * Double Counting | ||
| + | # [[media:21毕然OT1-3-2.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) | ||
| 第48行： | 第53行： | ||
* 《逻辑的引擎》前三章 | * 《逻辑的引擎》前三章 | ||
|- | |- | ||
| − | | | + | | 2021-11-1 |
| − | | 1-4-algorithm | + | | 1-4-algorithm[[media:2021-作业反馈1-4.pptx|习题讲解]] |
| | | | ||
* 尾递归 | * 尾递归 | ||
| + | # [[media:尾递归-林朗.pptx|林朗]] | ||
| + | # [[media:尾递归-陈荣锴.pptx|陈荣锴]]* | ||
| + | # [[media:尾递归(杨梓宣).pptx|杨梓宣]]* | ||
| + | # [[media:OT-尾递归-刘博悦.zip|刘博悦]]* | ||
* 结构化程序设计 | * 结构化程序设计 | ||
| + | # [[media:1-4-OT-structured_programming陈冀轩.pptx|陈冀轩]] | ||
| + | # [[media:梁子奇11.1OT.pptx|梁子奇]] | ||
| + | # [[media:OT_by_尹杰.pptx|尹杰]]* | ||
| + | #[[media:211240059孙骞.pptx|孙骞]]* | ||
| | | | ||
|- | |- | ||
| − | | | + | | 2021-11-08 |
| − | | 1-5-data-structure | + | | 1-5-data-structure[[media:2021作业反馈1-5.pptx|习题讲解]] |
| | | | ||
* Pointers and Arrays | * Pointers and Arrays | ||
| + | # [[media:1-5-Pointer-邓振霄.pptx|邓振霄]] | ||
| + | # [[media:李昕怡.pptx|李昕怡]] | ||
| + | # [[media:指针与数组-张明轩.pptx|张明轩]]* | ||
| + | # [[media:211240024蔡羽童.pptx|蔡羽童]] | ||
* Sequential Containers in C++ STL | * Sequential Containers in C++ STL | ||
| + | # [[media:OT-STL-胡皓明.pptx|胡皓明]] | ||
| + | # [[media:OT2-盖伟业-211240081.pptx|盖伟业]] | ||
| | | | ||
* [https://plato.stanford.edu/entries/recursive-functions/ Recursive Functions] | * [https://plato.stanford.edu/entries/recursive-functions/ Recursive Functions] | ||
| 第68行： | 第87行： | ||
| | | | ||
* 正则表达式 | * 正则表达式 | ||
| + | # [[media:OT正则表达式-徐妍.pptx|徐妍]] | ||
| + | # [[media:韩博侨.pptx|韩博侨]] | ||
| + | # [[media:正则表达式-郭佳茵.pptx|郭佳茵]] | ||
| + | # [[media:正则表达式-林凡琪.pptx|林凡琪]] | ||
* 程序设计语言的语义 | * 程序设计语言的语义 | ||
| + | # [[media:1-6-OT-陈楚安.pptx|陈楚安]] | ||
| + | # [[media:11-15_OT2_杨镇源.pptx|杨镇源]] | ||
| + | # [[media:Week6_OT-2_马尧_211240004.pptx|马尧]] | ||
| + | # [[media:OT-2-姜凯.pptx|姜凯]] | ||
| | | | ||
* "The Art of Computer Programming" (Vol 4A) by Donald Knuth | * "The Art of Computer Programming" (Vol 4A) by Donald Knuth | ||
Section 7.2.1.2 for "Generating All Permutations" | Section 7.2.1.2 for "Generating All Permutations" | ||
| + | * [https://zhzluke96.github.io/prolog-tut-cn/tut/chapter1.html) Prolog入门] | ||
|- | |- | ||
| | | | ||
| 1-7-programming-paradigm | | 1-7-programming-paradigm | ||
| | | | ||
| − | * | + | * 𝜆 𝑐𝑎𝑙𝑐𝑢𝑙𝑢𝑠 |
| − | # | + | # [[media:Lambda_calculus_缪天顺.pptx|缪天顺]] |
| − | # | + | # [[media:Lambda_calculus_胡嘉欣.pptx|胡嘉欣]] |
| − | * | + | # [[media:Ot1-李昀芃.zip|李昀芃]] |
| − | # | + | * Functional Programming |
| − | # | + | # [[media:Functional_Programming_赵欣玥.pptx|赵欣玥]] |
| + | # [[media:函数式编程中_王彦翔.pptx|王彦翔]] | ||
| + | # [[media:211240043胡德韬2班week7ot2.zip|胡德韬]] | ||
| | | | ||
* "The Art of Computer Programming" (Vol 1) by Donald Knuth | * "The Art of Computer Programming" (Vol 1) by Donald Knuth | ||
Section 2.2.1 for "Stackable/Queueable Permutations" | Section 2.2.1 for "Stackable/Queueable Permutations" | ||
|- | |- | ||
| − | | | + | | 2021-11-29 |
| − | | 1-8-set | + | | 1-8-set [[media:2021-作业反馈1-8.pptx|习题反馈]] |
| | | | ||
* 集合表示自然数 | * 集合表示自然数 | ||
| 第102行： | 第132行： | ||
|- | |- | ||
| | | | ||
| − | | 1-10-function | + | | [[media:2021-作业反馈1-10.pptx|1-10-function]] |
| | | | ||
* Lambda 演算 | * Lambda 演算 | ||
| 第109行： | 第139行： | ||
|- | |- | ||
| | | | ||
| − | | 1-11-infinity | + | | [[media:作业反馈1-11.pptx|1-11-infinity]] |
| | | | ||
* 基数 | * 基数 | ||
2021年12月20日 (一) 07:51的最新版本
学习周历
| 日期 | 论题 | Open Topics | 扩展材料
(供感兴趣的同学自学使用) |
|---|---|---|---|
| 2021-09-27/10-11 |
1-1-why 习题讲解 |
|
理解解题思路，完善解题细节 |
| 2021-10-18 | 1-2-reasoning习题讲解 |
|
|
| 2021-10-25 | 1-3-proof 习题讲解 |
|
再体会一下"Double Counting"的神奇之处。一开始会觉得困难，但当你一旦理解了，事情就变得非常简单而优雅。
|
| 2021-11-1 | 1-4-algorithm习题讲解 |
|
|
| 2021-11-08 | 1-5-data-structure习题讲解 |
|
递归函数论。感受可计算性的概念。思考 Bounded Iteration 与 Unbounded Iteration 的本质区别。 |
| 1-6-programming-language |
|
Section 7.2.1.2 for "Generating All Permutations" | |
| 1-7-programming-paradigm |
|
Section 2.2.1 for "Stackable/Queueable Permutations" | |
| 2021-11-29 | 1-8-set 习题反馈 |
|
|
| 1-9-relation |
|
||
| 1-10-function |
|
||
| 1-11-infinity |
|
||
| 复习 |
|
