Lectures and Recitations
From 6.006 Wiki
(Difference between revisions)
m |
m |
||
Line 35: | Line 35: | ||
- | + | ==== Lecture 4 : AVL trees (Balanced BSTs) ==== | |
- | + | ||
- | ==== Lecture 4 ==== | + | |
==== 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:10, 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.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
- Recitation02 Notes
- R02 warmup problems
-
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
- Recitation03 Notes
- R03 notes & warmup problems
-
BSTobjects.py
implements BSTs as python objects -
BSTlists.py
implementation extending the one shown in lecture