[TRANSLATION]Translate CS70.md

docs/数学进阶/CS70.en.md

@@ -0,0 +1,31 @@
+# UCB CS70: Discrete Math and Probability Theory
+
+## Descriptions
+
+- Offered by: UC Berkeley
+- Prerequisites: None
+- Programming Languages: None
+- Difficulty: 🌟🌟🌟
+- Class Hour: 60 hours
+
+This is Berkeley's introductory discrete mathematics course. The biggest highlight of this course is that it not only teaches you theoretical knowledge, but also introduce the applications of theoretical knowledge in practical algorithms in each module. In this way, students major in CS can consolidate the theoretical foundation as well as escaping the cold formal mathematical symbols, feel and experience the essence of theory in practical applications.
+
+Specific theory-algorithm correspondences are listed below.
+
+- Logic proof: stable matching algorithm
+- Graph theory: network topology design
+- Basic number theory: RSA algorithm
+- Polynomial ring: error-correcting code design
+- Probability theory: Hash table design, load balancing, etc.
+
+The course notes are also written in a very in-depth manner, with derivations of formulas and practical examples, providing a good reading experience.
+
+## Course Resources
+
+- Course Website: <http://www.eecs70.org/>
+- Textbook: refer to course website
+- Assignments: refer to course website
+
+## Personal Resources
+
+All the resources and assignments used by @PKUFlyingPig in this course are maintained in [PKUFlyingPig/UCB-CS70 - GitHub](https://github.com/PKUFlyingPig/UCB-CS70)