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


简介

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


链接

(目前更新了10节)


内容安排

来自官网 Calendar

LEC #TOPICSKEY DATES
1Introduction and proofs 
2InductionProblem set 1 due
3Strong induction 
4Number theory IProblem set 2 due
5Number theory II 
6Graph theory and coloringProblem set 3 due
7Matching problems 
8Graph theory II: minimum spanning treesProblem set 4 due
9Communication networks 
10Graph theory IIIProblem set 5 due
11Relations, partial orders, and scheduling 
12SumsProblem set 6 due
13Sums and asymptotics 
14Divide and conquer recurrencesProblem set 7 due
 Midterm 
15Linear recurrences 
16Counting rules IProblem set 8 due
17Counting rules II 
18Probability introductionProblem set 9 due
19Conditional probabilityProblem set 10 due
20Independence 
21Random variablesProblem set 11 due
22Expectation I 
23Expectation IIProblem set 12 due
24Large deviations 
25Random walks 


更多

待补充...