Lectures and Recitations
From 6.006 Wiki
(Difference between revisions)
m (→Recitation 1) |
|||
| Line 18: | Line 18: | ||
* [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] | ||
* (R06) [[Recitation02 Notes]] | * (R06) [[Recitation02 Notes]] | ||
| - | * (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | * (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/notes/rec02.pdf Rec 02 warmup] |
* (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/source/rec/r02%20-%20maxsumsubarray.py <code>maxsumsubarray.py</code>] | * (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/source/rec/r02%20-%20maxsumsubarray.py <code>maxsumsubarray.py</code>] | ||
| Line 28: | Line 28: | ||
==== Recitation 3 ==== | ==== Recitation 3 ==== | ||
* (R06) [[Recitation03 Notes]] | * (R06) [[Recitation03 Notes]] | ||
| - | * (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | * (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/notes/rec03.pdf Rec 03] |
* (R01, R02) [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 | * (R01, R02) [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 | ||
| Line 42: | Line 42: | ||
=== Hashing === | === Hashing === | ||
==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture5.pdf Lecture 5] : Hashing I==== | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture5.pdf Lecture 5] : Hashing I==== | ||
| + | ==== * (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/notes/rec05.pdf Rec 05] ==== | ||
Revision as of 17:59, 19 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
- (R06) Recitation01 Notes
- (R01, R02)
docdist_profiling.py
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
- (R06) Recitation02 Notes
- (R01, R02) Rec 02 warmup
- (R01, R02)
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
- (R06) Recitation03 Notes
- (R01, R02) Rec 03
- (R01, R02)
BSTobjects.pyimplements BSTs as python objects -
BSTlists.pyimplementation extending the one shown in lecture
Lecture 4 : AVL trees (Balanced BSTs)
Recitation 4
- AVL applet
- Another AVL applet
- (R03, R04)
AVL template - (R01, R02) Rec 04
- (R06) Recitation04 Notes
