https://johnqu.site/mit6000/ Recent content in MIT6.0001&2课程读书笔记 on John | 曲 Hugo -- gohugo.io en-us Fri, 25 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/2020-06-13-12-knapsack-and-graph-optimization-problems/ Sat, 13 Jun 2020 00:00:00 +0000 https://johnqu.site/mit6000/2020-06-13-12-knapsack-and-graph-optimization-problems/ What are the characters of optimization problem? In general, an optimization problem has two parts: An objective function that is to be maximized or minimized. For example, the airfare1 between Boston and Istanbul. A set of constraints (possibly empty) that must be honored2. For example, an upper bound3 on the travel time. What’s the main things to take away from this chapter? Many problems of https://johnqu.site/mit6000/plotting-and-more-about-classes/ Fri, 12 Jun 2020 00:00:00 +0000 https://johnqu.site/mit6000/plotting-and-more-about-classes/ How to use matplotlib.pyplot in *.Rmd file? Initiate a virtual environment. pip install virtualenv Have a test. import matplotlib.pyplot as pylab import numpy as np pylab.figure(1) #create figure 1 pylab.plot([1,2,3,4], [1,7,3,5]) #draw on figure 1 pylab.show() #show figure on screen What does rc mean in rcParams? runtime configuration. PyLab 绘图能力的完整用户指南参见 https://matplotlib.org/users/index.html 完整的颜色和线 https://johnqu.site/mit6000/some-simple-algorithms-and-data-structure/ Wed, 10 Jun 2020 00:00:00 +0000 https://johnqu.site/mit6000/some-simple-algorithms-and-data-structure/ Why the teacher will talk and why we should care so much about the efficiency of programs? The goal of this chapter is: Not to make you expert in designing efficient programs. To help you develop some general intuitions about how to approach questions of efficiency. By the time you get through this chapter you should understand: Why some programs complete in the blink of an eye, Why some need to run overnight, and Why some wouldn’t complete in your lifetime. https://johnqu.site/mit6000/algorithmic-complexity/ Tue, 09 Jun 2020 00:00:00 +0000 https://johnqu.site/mit6000/algorithmic-complexity/ What is the most important thing to think about when designing and implementing a program? It should produce result that can be relied upon. bank balance fuel injector airplane crashs Why sometimes performance is an important aspect of correctness? For programs that need to run in real time: warn airplanes of potential obstructions For performance affects utility: transactions completed per minutes of a database system start time of an application https://johnqu.site/mit6000/exceptions-and-assertions/ Fri, 29 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/exceptions-and-assertions/ Is “exception” rare? An “exception” is usually defined as “something that does not conform to the norm,” and is therefore somewhat rare. There is nothing rare about exceptions in Python. They are everywhere. Virtually every module https://johnqu.site/mit6000/classes-and-object-oriented-programming/ Fri, 29 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/classes-and-object-oriented-programming/ What is the key to object-oriented programming? Think about objects as collections of both data and the meth- ods that operate on that data. 8.1 Abstract Data Types and Classes Why bound a set of objects and the operations on those objects together with an abstract data type? One can pass an object from one part of a program to another, and in doing so provide access not only to https://johnqu.site/mit6000/exceptions-and-assertions/ Thu, 28 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/exceptions-and-assertions/ Is “exception” rare? An “exception” is usually defined as “something that does not conform to the norm,” and is therefore somewhat rare. There is nothing rare about exceptions in Python. They are everywhere. Virtually every module in the standard Python library uses them, and Python itself will raise them in many different circumstances. If you know that a line of code might raise an exception when executed, you should handle the exception. https://johnqu.site/mit6000/structured-types-mutability-and-higher-order-functions/ Wed, 27 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/structured-types-mutability-and-higher-order-functions/ 5.1 Tuples What is the similarity of tuple and string? Like strings, tuples are immutable ordered sequences of elements. The difference is that the elements of a tuple need not be characters. The individual elements can be of any type, and need not be of the same type as each other. What is Python’s multiple assignment statement? If you know the length of a sequence (e.g., a tuple or a string), it can be convenient to use Python’s multiple assignment statement to extract the individual elements. https://johnqu.site/mit6000/testing-and-debugging/ Wed, 27 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/testing-and-debugging/ What is testing and debugging? Testing is the process of running a program to try and ascertain whether or not it works as intended. Debugging is the process of trying to fix a program that you already know does not work as intended. How to design problems in ways that make them easier to test and debug? The key to doing this is breaking the program up into separate components that can be implemented, tested, and debugged independently of other components. https://johnqu.site/mit6000/functions-scoping-abstraction/ Tue, 26 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/functions-scoping-abstraction/ What is the disadvantage of a single piece of code? x = 25 epsilon = 0.01 numGuesses = 0 low = 0.0 high = max(1.0, x) ans = (high + low)/2.0 while abs(ans**2 - x) >= epsilon: print('low =', low, 'high =', high, 'ans =', ans) numGuesses += 1 if ans**2 < x: low = ans else: high = ans ans = (high + low)/2.0 ## low = 0.0 high https://johnqu.site/mit6000/preface-and-acknowledgments/ Mon, 25 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/preface-and-acknowledgments/ 6.00 to be replaced by new 6.0001 and 6.0002 6.00 to be replaced by new 6.0001 and 6.0002 I think 6.00 was never required for Course 6 students, at least not in recent history. Its replacements, 6.0001/2, aren’t requirements either. The Course 6 curriculum basically assumes you know how to code and hence doesn’t require courses that teach you https://johnqu.site/mit6000/getting-started/ Mon, 25 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/getting-started/ A computer does two things, and two things only: it performs calculations and it remembers the results of those calculations. What does it mean that knowing the history of human computation limitation? For most of human history, computation was limited by the speed of calculation of the human brain and the ability to record computational results with the human hand. This meant that only the smallest problems could be attacked computationally. https://johnqu.site/mit6000/introduction-to-python/ Mon, 25 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/introduction-to-python/ What dimensions can be used to describe the difference between programming languages? Low-level versus high-level General versus targeted Interpreted versus compiled Python is a general-purpose programming language that can be used effectively to build almost any kind of program that does not need direct access to the computer’s hardware. What is the disadvantages and advantages over other languages? Python is not https://johnqu.site/mit6000/some-simple-numerical-programs/ Mon, 25 May 2020 00:00:00 +0000 https://johnqu.site/mit6000/some-simple-numerical-programs/ 3.1 Exhaustive Enumeration What is decrementing function in a loop program block? The decrementing function in a loop has four properties: It maps a set of program variables into an integer. When the loop is entered, its value is nonnegative. When its value is ≤ 0, the loop terminates. Its value is decreased every time through the loop. Can we look down the exhaustive enumeration algorithms? The algorithmic technique used in this program is a variant of guess and check called exhaustive enumeration. https://johnqu.site/mit6000/classification-methods/ Fri, 25 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/classification-methods/ 什么是 classification model？ 它是有监督的机器学习中最常用的办法。 A classification model, or classifier 分类器 , is used to label an example as belonging to one of a finite set of categories. 比如 - 垃圾邮件分类。 称为 - belonging to a class https://johnqu.site/mit6000/clustering/ Tue, 22 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/clustering/ 相似聚簇的定义，举个生活例子？ 把对象组织成组的过程，每个组里的对象某种程度上相似。 关键议题是定义 “相似”。 例如下图 身高可以分成高矮，水平一条 https://johnqu.site/mit6000/a-quick-look-at-machine-learning/ Mon, 21 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/a-quick-look-at-machine-learning/ 为什么有必要让机器学会学习？ 数据量太大，人类理解跟不上。 the amount of digital data the human comprehension 数据存储量 3 年翻一番 需要从大量数据中拧出有用的信息 to wring more information from “big https://johnqu.site/mit6000/lies-damned-lies-and-statistics/ Sun, 20 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/lies-damned-lies-and-statistics/ 当我证明不了我想证明的东西？ “如果你想证明某事，却发现没有能力办到，那么试着解释其他事情并假装它们是一回事。在统计资料与人类思维冲撞所引起的 https://johnqu.site/mit6000/conditional-probability-and-bayesian-statistics/ Thu, 17 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/conditional-probability-and-bayesian-statistics/ 什么是统计学中的频率论方法？它的优点是？ 我们从样本中得出的结论完全基于数据的频率 frequency 或比例 proportion。这是最常用的一种推理框架 inference fr https://johnqu.site/mit6000/randomized-trails-and-hypothesis-checking/ Wed, 16 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/randomized-trails-and-hypothesis-checking/ 随机试验的英文其实是什么？ randomized trails randomized tests randomized experiment 进行 trail，而不是 experiment，也不是 test。 trial | ˈtrī(ə) l | noun 1 a formal examination of evidence before a judge, https://johnqu.site/mit6000/understanding-experimental-data/ Mon, 14 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/understanding-experimental-data/ 18.1 The Behavior of Springs 获得弹簧常数，实验科学家怎么做？ 做法一： 知道胡克定律，用一个质量，测一个位移，然后计算，确信得到了弹簧常数。 要想保证上面的结论是正 https://johnqu.site/mit6000/sampling-and-confidence-intervals/ Fri, 11 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/sampling-and-confidence-intervals/ 什么是总体，什么是样本？ Inferential statistics involves making inference about a population of examples by analyzing a randomly chosen subset (a sample) of that population. 抽样为什么重要？ 有时不可能对总体数据都进行处理。 抽样什么最重要？ 样本与总体 https://johnqu.site/mit6000/monte-carlo-simulation/ Wed, 09 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/monte-carlo-simulation/ 什么是蒙特卡洛模拟。 蒙特卡罗模拟用于求事件的近似概率，它多次执行同一模拟，然后将结果进行平均。 概率和赌运气有什么联系？ 乌拉姆不是第一个想使用 https://johnqu.site/mit6000/stochastic-programs-probability-and-distributions/ Fri, 04 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/stochastic-programs-probability-and-distributions/ 玻尔和爱因斯坦争论的是什么？ causal nondeterminism 因果关系不确定性 在最基础的层面上，物质世界的行为是不可预测的，我们只能做出像 “x 非常可能发生” 这样的概率上的 https://johnqu.site/mit6000/random-walk-and-more-about-data-visualization/ Wed, 02 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/random-walk-and-more-about-data-visualization/ 确定性程序的特点怎么描述？ 同样的输入，一样的输出。 时间一致性。 随机过程的特点怎么描述？ 下一刻的状态，依赖于一些随机因素，那么这个过程就是随机 https://johnqu.site/mit6000/dynamic-programming/ Tue, 01 May 2018 00:00:00 +0000 https://johnqu.site/mit6000/dynamic-programming/ 动态规划 dynamic programming 这个名字为什么名不符实？ Richard Bellman 在 1950 年代发明的这个算法，他自己认为在搞的数学，起这个名字，容易拿到国家经费。 was something not even a Congressman could object to. 动态规 https://johnqu.site/mit6000/knapsack-and-graph-optimization-problems/ Mon, 30 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/knapsack-and-graph-optimization-problems/ 12 KNAPSACK AND GRAPH OPTIMIZATION PROBLEMS 学最优化问题的目的是什么？ 生活中有很多类似问题，比如 the biggest, the smallest, the most, the fewest, the fastest, the least expensive，可以映射为最优化问题，找到经典解 https://johnqu.site/mit6000/plotting-and-more-about-classes/ Sun, 29 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/plotting-and-more-about-classes/ 图形的有很大意义吗？为什么很多程序都用语言输出？ 一张图可以表达很多意思。中国有这个谚语，一图胜千言？ 非不想也，实不便也。 在 Python 生态里，很幸运， https://johnqu.site/mit6000/some-simple-algorithms-and-data-structures/ Sat, 28 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/some-simple-algorithms-and-data-structures/ 上一章的目的不是让你设计高效程序，这一章的目的也不是设计厉害的算法，现实一点的目的是什么？ 上一章的目的：介绍分析复杂性需要用到的基本概念。 这 https://johnqu.site/mit6000/a-simplistic-introduction-to-algorithmic-complexity/ Tue, 24 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/a-simplistic-introduction-to-algorithmic-complexity/ 为什么关心计算复杂度？什么情况下关心程序效率？ 程序正确当然第一重要。在正确的前提下，就要讲究性能。 有实时性要求： - 飞机在碰到障碍前必须发出预 https://johnqu.site/mit6000/class-and-object-oriented-programming/ Sun, 22 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/class-and-object-oriented-programming/ 在 Python 里，用 class 做什么？ to organize programs around modules and data abstraction. 在 modules 和 data 层次。 是组织程序的一种方式。 abstraction 的是 data。 class 只有一种用法吗？ 很多种用法，其他是什么？ 主要是 “面 https://johnqu.site/mit6000/exceptions-and-assertions/ Sat, 21 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/exceptions-and-assertions/ “exception” 的含义在 Python 中有什么不同？ 英语中：not norm, thus rare. python 里：not rare, everywhere. 最常出现的 exception 的类型有哪四种？ TypeError IndexError NameError ValueError 7.1 Handing Exceptions exception 有哪两种命运？ https://johnqu.site/mit6000/testing-and-debugging/ Fri, 20 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/testing-and-debugging/ 测试和改错是什么？ 测试是一个过程，尝试和确认程序按照预定想法运行。 改错也是一个过程，尝试修好程序，当确认它没有按照预定想法运行时。 测试和改错 https://johnqu.site/mit6000/structured-types-mutability-and-higher-order-functions/ Mon, 16 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/structured-types-mutability-and-higher-order-functions/ 5.1 Tuples 为什么说 tuples 更像 string，而不是 list？ tuple 和 string 都是 不可更改的 有序的 元素序列 tuple 与 string 的区别仅仅在于 tuple 的元素可以是任何类型 string 的元素只可以是 https://johnqu.site/mit6000/function-scoping-and-abstraction/ Sat, 14 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/function-scoping-and-abstraction/ 只有分支与循环的程序能做什么？ 理论上说，它图灵完备，能做所有可计算的题目了。 只有分支与循环的程序有什么不足？ 缺乏通用性和代码重用性。 为什么？ https://johnqu.site/mit6000/some-simple-numerical-programs/ Tue, 10 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/some-simple-numerical-programs/ 3.1 Exhaustive Enumeration 用 while 的时候必须想好什么？ decrement function，什么时候停下来。 decrementing function 有哪四个属性？ 从问题中提取一组变量，把它映射到一个变量； 这个变量的初始 https://johnqu.site/mit6000/introduction-to-python/ Sun, 08 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/introduction-to-python/ 2 INTRODUCTION TO PYTHON 编程语言的差别，可以用哪几对天平衡量？ 低层 * low-level* v.s. 高层 * high-level* 通用 * General* v.s. 定向特定领域 *targeted to an application domain* 解释型 v.s. 编译型 Python 是什么类型的语言，有什么缺点 https://johnqu.site/mit6000/_index-back/ Sat, 07 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/_index-back/ 仓库内容 这里是我学习 Prof. Guttag 的 Introduction to Computation and Programming Using Python - With Application to Understanding Data 一书所做的摘要笔记，以及书中的程序例子。 另有 edX 上的练习和作业代码。MITx6001 和 6002 两 https://johnqu.site/mit6000/getting-started/ Fri, 06 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/getting-started/ 1. 怎么准备出发？ 计算为什么要借助机器，靠人不行吗？ 计算 = 运算 + 存储 人的能力很有限：大脑的运算速度和手的记录速度。 计算机擅长快速计算和大量存储 https://johnqu.site/mit6000/preface/ Wed, 04 Apr 2018 00:00:00 +0000 https://johnqu.site/mit6000/preface/ 课程从何而来 MIT 是 2006。MIT 的 OCW-Open CourseWare 从 2008 年起，有 2008，2011（Guttag 全程），2016（Bell Grimson Guttag 三人）三个版本。那里有给 MIT 学 https://johnqu.site/mit6000/2020-05-25-00-preface.nb/ Mon, 01 Jan 0001 00:00:00 +0000 https://johnqu.site/mit6000/2020-05-25-00-preface.nb/ 00 PREFACE and ACKNOWLEDGMENTS /*! jQuery v1.11.3 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ !function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l="1.11.3",m=function(a,b){return new m.fn.init(a,b)},n=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,o=/^-ms-/,p=/-([\da-z])/gi,q=function(a,b){return b.toUpperCase()};m.fn=m.prototype={jquery:l,constructor:m,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=m.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return m.each(this,a,b)},map:function(a){return this.pushStack(m.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0a?b:0);return this.pushStack(c=0&&bc?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},m.extend=m.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||m.isFunction(g)||(g={}),h===i&&(g=this,h--);ih;h++)if(null!=(e=arguments[h]))for(d in e)a=g[d],c=e[d],g!==c&&(j&&c&&(m.isPlainObject(c)||(b=m.isArray(c)))?(b?(b=!1,f=a&&m.isArray(a)?a:[]):f=a&&m.isPlainObject(a)?a:{},g[d]=m.extend(j,f,c)):void 0!==c&&(g[d]=c));return g},m.extend({expando:"jQuery"+(l+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===m.type(a)},isArray:Array.isArray||function(a){return"array"===m.type(a)},isWindow:function(a){return null!=a&&a==a.window},isNumeric:function(a){return!m.isArray(a)&&a-parseFloat(a)+1=0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},isPlainObject:function(a){var b;if(!a||"object"!==m.type(a)||a.nodeType||m.isWindow(a))return!1;try{if(a.constructor&&!j.call(a,"constructor")&&!j.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}if(k.ownLast)for(b in a)return j.call(a,b);for(b in a);return void 0===b||j.call(a,b)},type:function(a){return null==a? https://johnqu.site/mit6000/2020-05-25-03-some-simple-numerical-programs.nb/ Mon, 01 Jan 0001 00:00:00 +0000 https://johnqu.site/mit6000/2020-05-25-03-some-simple-numerical-programs.nb/ 03 SOME SIMPLE NUMERICAL PROGRAMS /*! jQuery v1.11.3 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ !function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l="1.11.3",m=function(a,b){return new m.fn.init(a,b)},n=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,o=/^-ms-/,p=/-([\da-z])/gi,q=function(a,b){return b.toUpperCase()};m.fn=m.prototype={jquery:l,constructor:m,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=m.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return m.each(this,a,b)},map:function(a){return this.pushStack(m.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0a?b:0);return this.pushStack(c=0&&bc?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},m.extend=m.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||m.isFunction(g)||(g={}),h===i&&(g=this,h--);ih;h++)if(null!=(e=arguments[h]))for(d in e)a=g[d],c=e[d],g!==c&&(j&&c&&(m.isPlainObject(c)||(b=m.isArray(c)))?(b?(b=!1,f=a&&m.isArray(a)?a:[]):f=a&&m.isPlainObject(a)?a:{},g[d]=m.extend(j,f,c)):void 0!==c&&(g[d]=c));return g},m.extend({expando:"jQuery"+(l+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===m.type(a)},isArray:Array.isArray||function(a){return"array"===m.type(a)},isWindow:function(a){return null!=a&&a==a.window},isNumeric:function(a){return!m.isArray(a)&&a-parseFloat(a)+1=0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},isPlainObject:function(a){var b;if(!a||"object"!==m.type(a)||a.nodeType||m.isWindow(a))return!1;try{if(a.constructor&&!j.call(a,"constructor")&&!j.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}if(k.ownLast)for(b in a)return j.call(a,b);for(b in a);return void 0===b||j. https://johnqu.site/mit6000/2020-05-26-04-functions-scoping-and-abstraction.nb/ Mon, 01 Jan 0001 00:00:00 +0000 https://johnqu.site/mit6000/2020-05-26-04-functions-scoping-and-abstraction.nb/ 04 FUNCTIONS, SCOPING, AND ABSTRACTION /*! jQuery v1.11.3 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ !function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l="1.11.3",m=function(a,b){return new m.fn.init(a,b)},n=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,o=/^-ms-/,p=/-([\da-z])/gi,q=function(a,b){return b.toUpperCase()};m.fn=m.prototype={jquery:l,constructor:m,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=m.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return m.each(this,a,b)},map:function(a){return this.pushStack(m.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0a?b:0);return this.pushStack(c=0&&bc?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},m.extend=m.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||m.isFunction(g)||(g={}),h===i&&(g=this,h--);ih;h++)if(null!=(e=arguments[h]))for(d in e)a=g[d],c=e[d],g!==c&&(j&&c&&(m.isPlainObject(c)||(b=m.isArray(c)))?(b?(b=!1,f=a&&m.isArray(a)?a:[]):f=a&&m.isPlainObject(a)?a:{},g[d]=m.extend(j,f,c)):void 0!==c&&(g[d]=c));return g},m.extend({expando:"jQuery"+(l+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===m.type(a)},isArray:Array.isArray||function(a){return"array"===m.type(a)},isWindow:function(a){return null!=a&&a==a.window},isNumeric:function(a){return!m.isArray(a)&&a-parseFloat(a)+1=0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},isPlainObject:function(a){var b;if(!a||"object"!==m.type(a)||a.nodeType||m.isWindow(a))return!1;try{if(a.constructor&&!j.call(a,"constructor")&&!j.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}if(k.ownLast)for(b in a)return j.call(a,b);for(b in a);return void 0===b||j. https://johnqu.site/mit6000/2020-05-27-06-testing-and-debugging.nb/ Mon, 01 Jan 0001 00:00:00 +0000 https://johnqu.site/mit6000/2020-05-27-06-testing-and-debugging.nb/ 06 TESTING AND DEBUGGING /*! jQuery v1.11.3 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ !function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l="1.11.3",m=function(a,b){return new m.fn.init(a,b)},n=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,o=/^-ms-/,p=/-([\da-z])/gi,q=function(a,b){return b.toUpperCase()};m.fn=m.prototype={jquery:l,constructor:m,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=m.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return m.each(this,a,b)},map:function(a){return this.pushStack(m.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0a?b:0);return this.pushStack(c=0&&bc?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},m.extend=m.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||m.isFunction(g)||(g={}),h===i&&(g=this,h--);ih;h++)if(null!=(e=arguments[h]))for(d in e)a=g[d],c=e[d],g!==c&&(j&&c&&(m.isPlainObject(c)||(b=m.isArray(c)))?(b?(b=!1,f=a&&m.isArray(a)?a:[]):f=a&&m.isPlainObject(a)?a:{},g[d]=m.extend(j,f,c)):void 0!==c&&(g[d]=c));return g},m.extend({expando:"jQuery"+(l+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===m.type(a)},isArray:Array.isArray||function(a){return"array"===m.type(a)},isWindow:function(a){return null!=a&&a==a.window},isNumeric:function(a){return!m.isArray(a)&&a-parseFloat(a)+1=0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},isPlainObject:function(a){var b;if(!a||"object"!==m.type(a)||a.nodeType||m.isWindow(a))return!1;try{if(a.constructor&&!j.call(a,"constructor")&&!j.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}if(k.ownLast)for(b in a)return j.call(a,b);for(b in a);return void 0===b||j.call(a,b)},type:function(a){return null==a? https://johnqu.site/mit6000/2020-05-29-07-exceptionns-and-assertions.nb/ Mon, 01 Jan 0001 00:00:00 +0000 https://johnqu.site/mit6000/2020-05-29-07-exceptionns-and-assertions.nb/ 07 EXCEPTIONS AND ASSERTIONS /*! jQuery v1.11.3 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ !function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l="1.11.3",m=function(a,b){return new m.fn.init(a,b)},n=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,o=/^-ms-/,p=/-([\da-z])/gi,q=function(a,b){return b.toUpperCase()};m.fn=m.prototype={jquery:l,constructor:m,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=m.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return m.each(this,a,b)},map:function(a){return this.pushStack(m.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0a?b:0);return this.pushStack(c=0&&bc?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},m.extend=m.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||m.isFunction(g)||(g={}),h===i&&(g=this,h--);ih;h++)if(null!=(e=arguments[h]))for(d in e)a=g[d],c=e[d],g!==c&&(j&&c&&(m.isPlainObject(c)||(b=m.isArray(c)))?(b?(b=!1,f=a&&m.isArray(a)?a:[]):f=a&&m.isPlainObject(a)?a:{},g[d]=m.extend(j,f,c)):void 0!==c&&(g[d]=c));return g},m.extend({expando:"jQuery"+(l+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===m.type(a)},isArray:Array.isArray||function(a){return"array"===m.type(a)},isWindow:function(a){return null!=a&&a==a.window},isNumeric:function(a){return!m.isArray(a)&&a-parseFloat(a)+1=0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},isPlainObject:function(a){var b;if(!a||"object"!==m.type(a)||a.nodeType||m.isWindow(a))return!1;try{if(a.constructor&&!j.call(a,"constructor")&&!j.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}if(k.ownLast)for(b in a)return j.call(a,b);for(b in a);return void 0===b||j.call(a,b)},type:function(a){return null==a? https://johnqu.site/mit6000/2020-05-29-08-classes-and-object-oriented-programming.nb/ Mon, 01 Jan 0001 00:00:00 +0000 https://johnqu.site/mit6000/2020-05-29-08-classes-and-object-oriented-programming.nb/ 08 CLASSES AND OBJECT-ORIENTED PROGRAMMING /*! jQuery v1.11.3 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ !function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l="1.11.3",m=function(a,b){return new m.fn.init(a,b)},n=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,o=/^-ms-/,p=/-([\da-z])/gi,q=function(a,b){return b.toUpperCase()};m.fn=m.prototype={jquery:l,constructor:m,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=m.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return m.each(this,a,b)},map:function(a){return this.pushStack(m.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0a?b:0);return this.pushStack(c=0&&bc?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},m.extend=m.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||m.isFunction(g)||(g={}),h===i&&(g=this,h--);ih;h++)if(null!=(e=arguments[h]))for(d in e)a=g[d],c=e[d],g!==c&&(j&&c&&(m.isPlainObject(c)||(b=m.isArray(c)))?(b?(b=!1,f=a&&m.isArray(a)?a:[]):f=a&&m.isPlainObject(a)?a:{},g[d]=m.extend(j,f,c)):void 0!==c&&(g[d]=c));return g},m.extend({expando:"jQuery"+(l+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===m.type(a)},isArray:Array.isArray||function(a){return"array"===m.type(a)},isWindow:function(a){return null!=a&&a==a.window},isNumeric:function(a){return!m.isArray(a)&&a-parseFloat(a)+1=0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},isPlainObject:function(a){var b;if(!a||"object"!==m.type(a)||a.nodeType||m.isWindow(a))return!1;try{if(a.constructor&&!j.call(a,"constructor")&&!j.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}if(k.ownLast)for(b in a)return j.call(a,b);for(b in a);return void 0===b||j. https://johnqu.site/mit6000/2020-06-12-11-plotting-and-more-about-classes.nb/ Mon, 01 Jan 0001 00:00:00 +0000 https://johnqu.site/mit6000/2020-06-12-11-plotting-and-more-about-classes.nb/ 11 PLOTTING AND MORE ABOUT CLASSES /*! jQuery v1.11.3 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ !function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l="1.11.3",m=function(a,b){return new m.fn.init(a,b)},n=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,o=/^-ms-/,p=/-([\da-z])/gi,q=function(a,b){return b.toUpperCase()};m.fn=m.prototype={jquery:l,constructor:m,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=m.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return m.each(this,a,b)},map:function(a){return this.pushStack(m.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0a?b:0);return this.pushStack(c=0&&bc?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},m.extend=m.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||m.isFunction(g)||(g={}),h===i&&(g=this,h--);ih;h++)if(null!=(e=arguments[h]))for(d in e)a=g[d],c=e[d],g!==c&&(j&&c&&(m.isPlainObject(c)||(b=m.isArray(c)))?(b?(b=!1,f=a&&m.isArray(a)?a:[]):f=a&&m.isPlainObject(a)?a:{},g[d]=m.extend(j,f,c)):void 0!==c&&(g[d]=c));return g},m.extend({expando:"jQuery"+(l+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===m.type(a)},isArray:Array.isArray||function(a){return"array"===m.type(a)},isWindow:function(a){return null!=a&&a==a.window},isNumeric:function(a){return!m.isArray(a)&&a-parseFloat(a)+1=0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},isPlainObject:function(a){var b;if(!a||"object"!==m.type(a)||a.nodeType||m.isWindow(a))return!1;try{if(a.constructor&&!j.call(a,"constructor")&&!j.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}if(k.ownLast)for(b in a)return j.call(a,b);for(b in a);return void 0===b||j. https://johnqu.site/mit6000/2020-06-13-12-knapsack-and-graph-optimization-problems.nb/ Mon, 01 Jan 0001 00:00:00 +0000 https://johnqu.site/mit6000/2020-06-13-12-knapsack-and-graph-optimization-problems.nb/ 12 KNAPSACK AND GRAPH OPTIMIZATION PROBLEMS /*! jQuery v1.11.3 | (c) 2005, 2015 jQuery Foundation, Inc. | jquery.org/license */ !function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l="1.11.3",m=function(a,b){return new m.fn.init(a,b)},n=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,o=/^-ms-/,p=/-([\da-z])/gi,q=function(a,b){return b.toUpperCase()};m.fn=m.prototype={jquery:l,constructor:m,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=m.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return m.each(this,a,b)},map:function(a){return this.pushStack(m.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0a?b:0);return this.pushStack(c=0&&bc?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},m.extend=m.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||m.isFunction(g)||(g={}),h===i&&(g=this,h--);ih;h++)if(null!=(e=arguments[h]))for(d in e)a=g[d],c=e[d],g!==c&&(j&&c&&(m.isPlainObject(c)||(b=m.isArray(c)))?(b?(b=!1,f=a&&m.isArray(a)?a:[]):f=a&&m.isPlainObject(a)?a:{},g[d]=m.extend(j,f,c)):void 0!==c&&(g[d]=c));return g},m.extend({expando:"jQuery"+(l+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===m.type(a)},isArray:Array.isArray||function(a){return"array"===m.type(a)},isWindow:function(a){return null!=a&&a==a.window},isNumeric:function(a){return!m.isArray(a)&&a-parseFloat(a)+1=0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},isPlainObject:function(a){var b;if(!a||"object"!==m.type(a)||a.nodeType||m.isWindow(a))return!1;try{if(a.constructor&&!j.call(a,"constructor")&&!j.call(a.constructor.prototype,"isPrototypeOf"))return!1}catch(c){return!1}if(k.ownLast)for(b in a)return j.call(a,b);for(b in a);return void 0===b||j.