-
Notifications
You must be signed in to change notification settings - Fork 6.8k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[COURSE] Harvard CS50P, MIT6.006, and MIT6.046 (#387)
* Typo fixed * Add MIT 6.006 * Add MIT 6.006 (En) * Add MIT 6.046 * Add MIT 6.046 * Add MIT 6.006 (en) * Add MIT 6.006 (en) * Add MIT 6.046 (en) * Add Harvard CS50P * Add Harvard CS50P * Add Harvard CS50P(En) * MIT Missing Semester timeline * CS50P added * Algorithms related courses added * Space added
- Loading branch information
1 parent
afa5d5a
commit af82c1f
Showing
9 changed files
with
133 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2 changes: 1 addition & 1 deletion
2
docs/数学进阶/The_Information_Theory_Pattern_Recognition_and_Neural_Networks.en.md
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
2 changes: 1 addition & 1 deletion
2
docs/数学进阶/The_Information_Theory_Pattern_Recognition_and_Neural_Networks.md
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
# MIT 6.006: Introduction to Algorithms | ||
|
||
## Descriptions | ||
|
||
- Offered by: MIT | ||
- Prerequisites: Introductory level courses of programming (CS50/CS61A/CS106A or equivalent) | ||
- Programming Languages: Python | ||
- Difficulty: 🌟🌟🌟🌟🌟 | ||
- Class Hour: 100 hours+ | ||
|
||
Probably the most precious course from the EECS department of MIT. Taught by Erik Demaine, one of the geniuses in Algorithms. | ||
|
||
Compared with CS106B/X (Data structures and algorithms using C++), 6.006 emphasizes the algorithms more. It also covers several classical data structures such as AVL trees. You may use it to learn more about algorithms after CS106B/X. | ||
|
||
## Course Resources | ||
|
||
- Course Website: [Fall 2011](https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/) | ||
- Recordings: [Fall 2011](https://www.bilibili.com/video/BV1b7411e7ZP) | ||
- Textbooks: Introduction to Algorithms (CLRS) | ||
- Assignments: [Fall 2011](https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/pages/assignments/) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
# MIT 6.006: Introduction to Algorithms | ||
|
||
## 课程简介 | ||
|
||
- 所属大学:MIT | ||
- 先修要求:计算机导论(CS50/CS61A or equivalent) | ||
- 编程语言:Python | ||
- 课程难度:🌟🌟🌟🌟🌟 | ||
- 预计学时:100h+ | ||
|
||
MIT-EECS 系的瑰宝。授课老师之一是算法届的奇才 Erik Demaine. 相比较于斯坦福的 [CS106B/X](../编程入门/CS106B_CS106X.md)(基于 C++ 的数据结构与算法课程),该课程更侧重于算法方面的详细讲解。课程也覆盖了一些经典的数据结构,如 AVL 树等。个人感觉在讲解方面比 CS106B 更加详细,也弥补了 CS106B 在算法方面讲解的不足。适合在 CS106B 入门之后巩固算法知识。 | ||
|
||
不过该课程也是出了名的难,大家需要做好一定的心理准备。 | ||
|
||
## 课程资源 | ||
|
||
- 课程网站:[Fall 2011](https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/) | ||
- 课程视频:[Fall 2011](https://www.bilibili.com/video/BV1b7411e7ZP) | ||
- 课程教材:Introduction to Algorithms (CLRS) | ||
- 课程作业:[Fall 2011](https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/pages/assignments/) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
# MIT 6.046: Design and Analysis of Algorithms | ||
|
||
## Descriptions | ||
|
||
- Offered by: MIT | ||
- Prerequisites: Introductory level courses of Algorithms (6.006/CS61B/CS106B/CS106X or equivalent) | ||
- Programming Languages: Python | ||
- Difficulty: 🌟🌟🌟🌟🌟 | ||
- Class Hour: 100 hours+ | ||
|
||
Part 2 of the MIT Algorithms Trilogy. Taught by Erik Demaine, Srini Devadas, and Nancy Lynch. | ||
|
||
Compared with 6.006 where you just learn and use the algorithms directly, in 6.046 you will be required to learn a methodology to "Design and analyze" algorithms to solve certain problems. There are few programming exercises in this course, and most of the assignmnets are about proposing an algorithm and do some mathematical proofs. Therefore, it would be much harder than 6.006. | ||
|
||
Part 3 of the MIT Algorithms Trilogy is 6.854 Advanced Algorithms. But for the most of the exercises you'll encounter in tests and job-hunting, 6.046 is definitely enough. | ||
|
||
## Course Resources | ||
|
||
- Course Website: [Spring 2015](https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/) | ||
- Recordings: [Spring 2015](https://www.bilibili.com/video/BV1A7411E737) | ||
- Textbooks: Introduction to Algorithms (CLRS) | ||
- Assignments: [Spring 2015](https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/pages/assignments/) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
# MIT 6.046: Design and Analysis of Algorithms | ||
|
||
## 课程简介 | ||
|
||
- 所属大学:MIT | ||
- 先修要求:算法入门(6.006/CS61B/CS106B/CS106X or equivalent) | ||
- 编程语言:Python | ||
- 课程难度:🌟🌟🌟🌟🌟 | ||
- 预计学时:100h+ | ||
|
||
6.006的后续课程。授课老师依旧是 Erik Demaine 和 Srini Devadas,此外还有一位新老师 Nancy Lynch. | ||
|
||
相比较于“现学现用”的6.006,6.046更加侧重于如何运用课上所学到的内容举一反三,设计出一套完备的算法并能够证明该算法能解决相应的问题。虽然该课程在板书以及作业中的编程语言为 Python,但基本上没有编程作业;绝大部分的作业都是提出要求,然后需要学生进行算法设计以及合理性证明。所以该课程的难度又提高了一大截:) | ||
|
||
在该门课程后还有一门 6.854 高级算法,但对于绝大多数考试以及应聘来说,学完该课程基本上已经能覆盖99%的题目了。 | ||
|
||
## 课程资源 | ||
|
||
- 课程网站:[Spring 2015](https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/) | ||
- 课程视频:[Spring 2015](https://www.bilibili.com/video/BV1A7411E737) | ||
- 课程教材:Introduction to Algorithms (CLRS) | ||
- 课程作业:[Spring 2015](https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/pages/assignments/) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
# CS50P Introduction to Programming with Python | ||
|
||
## Descriptions | ||
|
||
- Offered by: Harvard University | ||
- Prerequisites: No prerequisites | ||
- Programming Languages: Python | ||
- Difficulty: 🌟🌟 | ||
- Class Hour: 30-40 hours | ||
|
||
One of the CS50 families, taught by David J. Malan. You'll learn how to program in Python and "Pythonic" ways to deal with everthing. The course also introduces libraries, code testing, and handling exceptions. | ||
|
||
No programming experiences are assumed. So it may be appropriate for anyone who wants to learn Python. | ||
|
||
## Course Resources | ||
|
||
- Course Website: [2022](https://cs50.harvard.edu/python/2022/) | ||
- Recordings: [2022](https://www.bilibili.com/video/BV1z5411X7wX) | ||
- Textbooks: No textbook required | ||
- Assignments: [2022](https://cs50.harvard.edu/python/2022/) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
# CS50P Introduction to Programming with Python | ||
|
||
## 课程简介 | ||
|
||
- 所属大学:Harvard University | ||
- 先修要求:无 | ||
- 编程语言:Python | ||
- 课程难度:🌟🌟 | ||
- 预计学时:30-40 hours | ||
|
||
CS50的番外篇,依旧由 David J. Malan 授课。在该课程中你将学会 Python 的基础与进阶语法,以及各种 “Pythonic” 的编程方法。此外对于 Python 特色的代码库、代码测试以及错误处理,该课程也会较为深入地探究。 | ||
|
||
该课程无需任何编程基础,且相对平易近人。适合所有想要快速入门 Python 语言的各阶段学生。 | ||
|
||
## 课程资源 | ||
|
||
- 课程网站:[2022](https://cs50.harvard.edu/python/2022/) | ||
- 课程视频:[2022](https://www.bilibili.com/video/BV1z5411X7wX) | ||
- 课程教材:无 | ||
- 课程作业:[2022](https://cs50.harvard.edu/python/2022/) |