Lectures and Recitations
From 6.006 Wiki
(Difference between revisions)
| Line 1: | Line 1: | ||
=== Introduction and Document Distance === | === Introduction and Document Distance === | ||
| - | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture01.pdf Lecture 1], Introduction and Document Distance ==== |
* [[Document Distance]] (docdist{1,2,3,4}.py) | * [[Document Distance]] (docdist{1,2,3,4}.py) | ||
* Readings: CLRS Chapters 1,2,3 | * Readings: CLRS Chapters 1,2,3 | ||
| Line 8: | Line 8: | ||
* (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/ | + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture02.pdf Lecture 2], Document Distance, Mergesort ==== |
* [[Document Distance]] (docdist{5,6}.py) | * [[Document Distance]] (docdist{5,6}.py) | ||
* [http://courses.csail.mit.edu/6.006/fall08/source/mergesort.py <code>mergesort.py</code>] code from class | * [http://courses.csail.mit.edu/6.006/fall08/source/mergesort.py <code>mergesort.py</code>] code from class | ||
| Line 22: | Line 22: | ||
=== Binary Search Trees === | === Binary Search Trees === | ||
| - | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture03.pdf Lecture 3], Binary Search Trees ==== |
* [http://courses.csail.mit.edu/6.006/fall08/source/runway.py <code>runway.py</code>] code from class | * [http://courses.csail.mit.edu/6.006/fall08/source/runway.py <code>runway.py</code>] code from class | ||
* Readings: CLRS Chapter 10; Chapter 12, Sections 1-3 | * Readings: CLRS Chapter 10; Chapter 12, Sections 1-3 | ||
| Line 32: | Line 32: | ||
* [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 | ||
| - | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture04.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] | ||
| Line 41: | Line 41: | ||
=== Hashing === | === Hashing === | ||
| - | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture05.pdf Lecture 5] : Hashing I==== |
Readings: CLRS 11.1-11.3 | Readings: CLRS 11.1-11.3 | ||
| Line 47: | Line 47: | ||
* (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/notes/rec05.pdf Rec 05] | * (R01, R02) [http://courses.csail.mit.edu/6.006/fall08/notes/rec05.pdf Rec 05] | ||
| - | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/ | + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture06.pdf Lecture 6] : Hashing II==== |
Readings: CLRS 17, 32.2 | Readings: CLRS 17, 32.2 | ||
==== Recitation 6 ==== | ==== Recitation 6 ==== | ||
* (R01, R02, R05) [http://courses.csail.mit.edu/6.006/fall08/notes/rec06.pdf Rec 06] | * (R01, R02, R05) [http://courses.csail.mit.edu/6.006/fall08/notes/rec06.pdf Rec 06] | ||
| + | |||
| + | ==== [http://courses.csail.mit.edu/6.006/fall08/notes/lecture07.pdf Lecture 7] : Hashing III==== | ||
| + | Readings: CLRS 11.4, 11.3.3, 11.5 | ||
Revision as of 17:16, 25 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
Hashing
Lecture 5 : Hashing I
Readings: CLRS 11.1-11.3
Recitation 5
- (R01, R02) Rec 05
Lecture 6 : Hashing II
Readings: CLRS 17, 32.2
Recitation 6
- (R01, R02, R05) Rec 06
Lecture 7 : Hashing III
Readings: CLRS 11.4, 11.3.3, 11.5
