《Mathematics for Computer Science》 - MIT 6.042J&18.062J FALL 2011

简介

《Mathematics for Computer Science》是麻省理工学院计算机科学与工程专业本科生的初等离散数学课程。课程涵盖了国外计算机科学专业涉及的基础数学知识，内容涉及形式逻辑符号、数学证明、归纳、集合与关系、图论基础、排列与组合、计数原理、离散概率、递归等，特别强调数学定义、证明及其应用方法。（摘自豆瓣）

链接

（目前更新了10节）

内容安排

来自官网 Calendar：

LEC # TOPICS KEY DATES
1 Introduction and proofs
2 Induction Problem set 1 due
3 Strong induction
4 Number theory I Problem set 2 due
5 Number theory II
6 Graph theory and coloring Problem set 3 due
7 Matching problems
8 Graph theory II: minimum spanning trees Problem set 4 due
9 Communication networks
10 Graph theory III Problem set 5 due
11 Relations, partial orders, and scheduling
12 Sums Problem set 6 due
13 Sums and asymptotics
14 Divide and conquer recurrences Problem set 7 due
Midterm
15 Linear recurrences
16 Counting rules I Problem set 8 due
17 Counting rules II
18 Probability introduction Problem set 9 due
19 Conditional probability Problem set 10 due
20 Independence
21 Random variables Problem set 11 due
22 Expectation I
23 Expectation II Problem set 12 due
24 Large deviations
25 Random walks

更多

待补充…