Lectures and Recitations
From 6.006 Wiki
(Difference between revisions)
m (→Recitation 4) |
(added lecture 5 notes) |
||
| Line 42: | Line 42: | ||
* [http://courses.csail.mit.edu/6.006/fall08/notes/rec04.pdf Rec 04] | * [http://courses.csail.mit.edu/6.006/fall08/notes/rec04.pdf Rec 04] | ||
* [[Recitation04 Notes]] | * [[Recitation04 Notes]] | ||
| + | |||
| + | |||
| + | === Hashing === | ||
| + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture5.pdf Lecture 5] ==== | ||
Revision as of 02:48, 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
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
Lecture 4 : AVL trees (Balanced BSTs)
Recitation 4
