mit 计算机科学及编程导论(12)
2012-07-29 17:02
302 查看
words:
introspective , swallow your pride , latency , saw , symptom , haste , ramification , dust , raisin , tidy , revert , directory , anal , sermon , polemic , formulate , optimize , dual , constraint , bin , van , align , backpack , blanket , inventory ,
polynomial , burglar , grape , the periodic table , pour , dessert , thereof , discrete , stuff , trial , incarcerate , augment , dramatic
notes:
sth added to debug:
1. experienced programmer will have their own module to debug , they will list some bugs they usually made and guess them first.
2. keep record of what you've tried to be systematic
3. get help , try to explain to someone else or take a break
4.haste makes waste : don't fix when the thought first comes into your mind but to think will it fix all the symptoms (bug-free program)
5. make sure you can revert , save the old version
optimization problem : a function to maximize or minimize & a set of constraints
1. continuous knapsack problem : greedy algorithm --- always do the best choices
2. discrete problem : 0/1 knapsack problem . greedy algorithm doesn't work anymore , since local optimal decisions do not always lead to global optimal decisions. But greedy algorithm is fast and easy to capture . Brute force can get the right answer but
it's order of growth is exponential. So how we can optimize the brute force . We must first figure out themath formulation of the problem in order to compute. Then we usedecision tree to
analyze , and program . And we ascertain we can usememorization
to optimize .
ps:
the professor use optimization problem to show us how to formulate problem into math form and then use computer to compute . This is the main theme in this course.
introspective , swallow your pride , latency , saw , symptom , haste , ramification , dust , raisin , tidy , revert , directory , anal , sermon , polemic , formulate , optimize , dual , constraint , bin , van , align , backpack , blanket , inventory ,
polynomial , burglar , grape , the periodic table , pour , dessert , thereof , discrete , stuff , trial , incarcerate , augment , dramatic
notes:
sth added to debug:
1. experienced programmer will have their own module to debug , they will list some bugs they usually made and guess them first.
2. keep record of what you've tried to be systematic
3. get help , try to explain to someone else or take a break
4.haste makes waste : don't fix when the thought first comes into your mind but to think will it fix all the symptoms (bug-free program)
5. make sure you can revert , save the old version
optimization problem : a function to maximize or minimize & a set of constraints
1. continuous knapsack problem : greedy algorithm --- always do the best choices
2. discrete problem : 0/1 knapsack problem . greedy algorithm doesn't work anymore , since local optimal decisions do not always lead to global optimal decisions. But greedy algorithm is fast and easy to capture . Brute force can get the right answer but
it's order of growth is exponential. So how we can optimize the brute force . We must first figure out themath formulation of the problem in order to compute. Then we usedecision tree to
analyze , and program . And we ascertain we can usememorization
to optimize .
ps:
the professor use optimization problem to show us how to formulate problem into math form and then use computer to compute . This is the main theme in this course.
相关文章推荐
- mit 计算机科学及编程导论(6)
- mit 计算机科学及编程导论(7)
- mit 计算机科学及编程导论(17,18,19)
- 计算机科学与编程导论小习题-MIT
- mit 计算机科学及编程导论(1)
- mit 计算机科学及编程导论(9)
- mit 计算机科学及编程导论(13)
- mit 计算机科学及编程导论(1)
- mit 计算机科学及编程导论(10)
- mit 计算机科学及编程导论(11)
- mit 计算机科学及编程导论(2)
- mit 计算机科学及编程导论(14,15,16)
- MIT公开课---计算机科学及编程导论
- MIT计算机科学及编程导论02课学习笔记
- 学习日记-MIT[计算机科学与编程导论]-7,8
- 计算机科学与Python编程导论_MIT 学习笔记(二)
- 计算机科学与Python编程导论_MIT 学习笔记(四)
- MIT挑战(如何在12个月内自学完成MIT计算机科学的33门课程|内附MIT公开课程资源和学习顺序
- 怎样看待 12 个月内自学完成 4 年麻省理工学院计算机科学的 33 门课程的 Scott H. Young 所谓的超速学习理论和方法(费曼技巧)以及背后「Get More from Life」的理念
- MIT计算机科学与编程导论——class1