“2021级--小班讨论 (第二学期)”的版本间的差异
来自问题求解
(→学习周历) |
(→学习周历) |
||
(未显示同一用户的21个中间版本) | |||
第1行: | 第1行: | ||
== 学习周历 == | == 学习周历 == | ||
− | |||
{| border=1 | {| border=1 | ||
第32行: | 第31行: | ||
| | | | ||
|- | |- | ||
+ | | 2022-02-28 | ||
+ | | | ||
+ | 2-1 算法正确性 | ||
+ | | | ||
+ | # Insertion Sort and Dafny | ||
+ | * 赵欣玥 | ||
+ | * 杨梓宣 | ||
+ | * 孙骞 | ||
+ | # Cyclic Hanoi Problem | ||
+ | * 梁子奇 | ||
+ | * 刘熹橦 | ||
+ | * 陈荣锴 | ||
+ | | | ||
+ | *[[Media:ArXiv12_1211.4470_(CSUR12)_Loop_Invariants_Analysis_Classification_and_Examples.pdf | Paper: Loop Invariants: Analysis, Classification, and Examples.pdf]] | ||
+ | (阅读建议: 不必一次性读完 (这也不太现实); | ||
+ | 先阅读第一章,从宏观角度理解循环不变式。 | ||
+ | 再对照目录,在适当时候阅读相应算法。) | ||
+ | |- | ||
+ | | 2022-03-07 | ||
+ | | | ||
+ | 2-2 算法的效率 | ||
+ | | | ||
+ | # Decision Tree | ||
+ | * 黄俊荣 | ||
+ | * 李鸿毅 | ||
+ | * 徐研 | ||
+ | # Adversary Strategy | ||
+ | * 康一博 | ||
+ | * 姜凯 | ||
+ | * 吴奕胜 | ||
+ | | | ||
+ | |- | ||
+ | | 2022-03-15 | ||
+ | | | ||
+ | 2-3 组合与计数 | ||
+ | | | ||
+ | # Sums | ||
+ | * 刘嘉欣 | ||
+ | * 周懿添 | ||
+ | * 许世泽 | ||
+ | # Binomial Coefficients | ||
+ | * 盖伟业 | ||
+ | * 付博 | ||
+ | | | ||
+ | * [[Media:The_Art_of_Computer_Programmin_Volume4A_Combinatorial_Algorithms.pdf | The Art of Computer Programming Vol4A: Combinatorial Algorithms Part 1]] | ||
+ | (阅读建议: 学习各种组合对象的生成 (Generating) 算法。) | ||
+ | |- | ||
+ | | 2022-03-22 | ||
+ | | | ||
+ | 2-4 分治法与递归 | ||
+ | | | ||
+ | # Akra-Bazzi Method | ||
+ | * 凌众翔 | ||
+ | * 胡皓明 | ||
+ | # Merge-Sort | ||
+ | * 邵钰乾 | ||
+ | * 张明轩 | ||
+ | |- | ||
+ | | 2022-03-29 | ||
+ | | | ||
+ | 2-5 递归式求解 | ||
+ | | | ||
+ | # Generating Functions | ||
+ | * 鞠哲 | ||
+ | * 蔡昊润 | ||
+ | * 尹杰 | ||
+ | * 林凡琪 | ||
+ | | | ||
+ | * [[Media: Concrete_Mathematics_-_R._Graham,_D._Knuth,_O._Patashnik.pdf | Concrete Mathematics. R. Graham, D. Knuth, O. Patashnik.pdf]] | ||
+ | (阅读建议: 第七章 (7.2-7.5)。Generating Function。) | ||
+ | |||
+ | |- | ||
+ | | 2022-04-2 | ||
+ | | | ||
+ | 2-6 algorithmic-methods | ||
+ | | | ||
+ | # SAT Problem | ||
+ | * 董睿祺 | ||
+ | * 朱家辰 | ||
+ | # alpha-beta Pruning | ||
+ | * 马尧 | ||
+ | * 陈卓 | ||
+ | | | ||
+ | * | ||
+ | |- | ||
+ | | 2022-04-11 | ||
+ | | 2-7-discrete-probability | ||
+ | * <!--[[media:2-7-discrete-probability.pdf|-->2-7-discrete-probability<!--]]--> | ||
+ | * <!--[[media:2-7-discrete-probability-handout.pdf|-->2-7-discrete-probability-handout<!--]]--> | ||
+ | | | ||
+ | * Monty Hall Problem | ||
+ | # 胡嘉欣 | ||
+ | # 邓振霄 | ||
+ | # 陈宇宁 | ||
+ | |||
+ | * Shuffling Cards | ||
+ | # 郑九铭 | ||
+ | # 张牧牧 | ||
+ | # 邹睿恒 | ||
+ | | | ||
+ | * [https://github.com/hengxin/problem-solving-class-paperswelove/blob/master/2nd-semester/Philosophy%20of%20Probability.pdf Philosophy of Probability.pdf] | ||
+ | 学习哲学有什么用?它的用处在于让你的头脑变得混乱,然后再从混乱走向明晰。 | ||
+ | |- | ||
+ | | 2022-04-18 | ||
+ | | 2-8-probabilistic-analysis | ||
+ | | | ||
+ | * Average-case Analysis of FindMax | ||
+ | # 陈星宇 | ||
+ | # 李骏骁 | ||
+ | |||
+ | * Average-case Analysis of Binary Search | ||
+ | # 黄泽方 | ||
+ | # 毕然 | ||
+ | | | ||
+ | |- | ||
+ | | 2022-04-25 | ||
+ | | 2-9-sorting-selection | ||
+ | | | ||
+ | * Average-case Analysis of FindMax | ||
+ | # 赵烜呈 | ||
+ | |||
+ | * Sorting Algorithms | ||
+ | # 施远卓 | ||
+ | # 郑义云 | ||
+ | | | ||
|} | |} |
2022年4月27日 (三) 09:04的最新版本
学习周历
日期 | 论题 | Open Topics | 扩展材料
(供感兴趣的同学自学使用) |
---|---|---|---|
2022-02-14 |
2-0 期末试题讲解 |
无 |
|
2022-02-21 |
1-13 布尔代数习题讲解 |
|
|
2022-02-28 |
2-1 算法正确性 |
|
(阅读建议: 不必一次性读完 (这也不太现实); 先阅读第一章,从宏观角度理解循环不变式。 再对照目录,在适当时候阅读相应算法。) |
2022-03-07 |
2-2 算法的效率 |
|
|
2022-03-15 |
2-3 组合与计数 |
|
(阅读建议: 学习各种组合对象的生成 (Generating) 算法。) |
2022-03-22 |
2-4 分治法与递归 |
| |
2022-03-29 |
2-5 递归式求解 |
|
(阅读建议: 第七章 (7.2-7.5)。Generating Function。) |
2022-04-2 |
2-6 algorithmic-methods |
|
|
2022-04-11 | 2-7-discrete-probability
|
|
学习哲学有什么用?它的用处在于让你的头脑变得混乱,然后再从混乱走向明晰。 |
2022-04-18 | 2-8-probabilistic-analysis |
|
|
2022-04-25 | 2-9-sorting-selection |
|