Lectures and Recitations
From 6.006 Wiki
(Difference between revisions)
m |
|||
| Line 19: | Line 19: | ||
* [https://courses.csail.mit.edu/6.006/fall08/handouts/protected/Bentley.pdf Jon Bentley's column on the maximum sum contiguous vector problem discussed in class] | * [https://courses.csail.mit.edu/6.006/fall08/handouts/protected/Bentley.pdf Jon Bentley's column on the maximum sum contiguous vector problem discussed in class] | ||
* [[Recitation02 Notes]] | * [[Recitation02 Notes]] | ||
| - | * [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | * [http://courses.csail.mit.edu/6.006/fall08/notes/rect02.pdf Rec 02 warmup] |
* [http://courses.csail.mit.edu/6.006/fall08/source/rec/r02%20-%20maxsumsubarray.py <code>maxsumsubarray.py</code>] | * [http://courses.csail.mit.edu/6.006/fall08/source/rec/r02%20-%20maxsumsubarray.py <code>maxsumsubarray.py</code>] | ||
| Line 30: | Line 30: | ||
==== Recitation 3 ==== | ==== Recitation 3 ==== | ||
* [[Recitation03 Notes]] | * [[Recitation03 Notes]] | ||
| - | * [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | * [http://courses.csail.mit.edu/6.006/fall08/notes/rect03.pdf Rec 03] |
* [http://courses.csail.mit.edu/6.006/fall08/source/rec/r03%20-%20BST%20v2%20master.py <code>BSTobjects.py</code>] implements BSTs as python objects | * [http://courses.csail.mit.edu/6.006/fall08/source/rec/r03%20-%20BST%20v2%20master.py <code>BSTobjects.py</code>] implements BSTs as python objects | ||
* [http://courses.csail.mit.edu/6.006/fall08/source/rec/r03%20-%20BST%20-%20jayant.py <code>BSTlists.py</code>] implementation extending the one shown in lecture | * [http://courses.csail.mit.edu/6.006/fall08/source/rec/r03%20-%20BST%20-%20jayant.py <code>BSTlists.py</code>] implementation extending the one shown in lecture | ||
| - | ==== Lecture 4 : AVL trees (Balanced BSTs) ==== | + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture4.pdf Lecture 4] : AVL trees (Balanced BSTs) ==== |
==== Recitation 4 ==== | ==== Recitation 4 ==== | ||
* [http://www.site.uottawa.ca/~stan/csi2514/applets/avl/BT.html AVL applet] | * [http://www.site.uottawa.ca/~stan/csi2514/applets/avl/BT.html AVL applet] | ||
Revision as of 02:13, 17 September 2008
Contents |
Introduction and Document Distance
Lecture 1, Introduction and Document Distance
- Document Distance (docdist{1,2,3,4}.py)
- Readings: CLRS Chapters 1,2,3
Recitation 1
Lecture 2, Document Distance, Mergesort
- Document Distance (docdist{5,6}.py)
-
mergesort.pycode from class - Readings:
- CLRS Chapter 11, Sections 1-2; CLRS Chapter 4
- Python Cost Model
Recitation 2 : maximum sum contiguous subarray problem
- Jon Bentley's column on the maximum sum contiguous vector problem discussed in class
- Recitation02 Notes
- Rec 02 warmup
-
maxsumsubarray.py
Binary Search Trees
Lecture 3, Binary Search Trees
-
runway.pycode from class - Readings: CLRS Chapter 10; Chapter 12, Sections 1-3
Recitation 3
- Recitation03 Notes
- Rec 03
-
BSTobjects.pyimplements BSTs as python objects -
BSTlists.pyimplementation extending the one shown in lecture
