Lectures and Recitations
From 6.006 Wiki
(Difference between revisions)
m (→Recitation 2 : maximum sum contiguous subarray problem) |
m (→Recitation 1) |
||
Line 5: | Line 5: | ||
==== Recitation 1 ==== | ==== Recitation 1 ==== | ||
- | * [[Recitation01 Notes]] | + | * (R06) [[Recitation01 Notes]] |
* (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/source/rec/r01%20-%20docdist.py <code>docdist_profiling.py</code>] | * (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/source/rec/r01%20-%20docdist.py <code>docdist_profiling.py</code>] | ||
- | |||
==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture2.pdf Lecture 2], Document Distance, Mergesort ==== | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture2.pdf Lecture 2], Document Distance, Mergesort ==== |
Revision as of 13:00, 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.py
code 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.py
code from class - Readings: CLRS Chapter 10; Chapter 12, Sections 1-3
Recitation 3
- (R06) Recitation03 Notes
- (R01, R02) Rec 03
- (R01, R02)
BSTobjects.py
implements BSTs as python objects -
BSTlists.py
implementation 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