Lectures and Recitations

(Difference between revisions)

Revision as of 16:48, 22 February 2008

Lecture 1, Introduction and Document Distance
- Document Distance (docdist{1,2,3,4}.py)
- Readings: CLRS, Chapters 1, 2, 3.
Recitation 1, Document Distance in Python (docdist{1,2,3,4}.py)
- Victor's Slides [PDF] | [Zipped Keynote]

Lecture 2, More Document Distance, Mergesort
- Document Distance (docdist{5,6}.py)
- Readings: CLRS, Sections 11.1 and 11.2.
Recitation 2, Python Cost Model, Review for Asymptotic Notation & Mergesort
- Victor's Slides [PDF] | [Zipped Keynote] | [Zipped Data (Numbers)]
- Python Cost Model

Lecture 3, Airplane scheduling; Binary Search Trees
- Binary Search Trees (including code)
- Readings: CLRS, Chapter 10 and Sections 12.1-12.3

Recitation 3, Binary Search Trees
- Victor's Slides [PDF] | [Zipped Keynote]
- Code for Binary Search Trees augmented with subtree size [Python]

Lecture 4, Balanced Binary Search Trees
- See Binary Search Trees for AVL code
- Readings: CLRS, Sections 13.1 and 13.2 for a different approach (red-black trees)
- AVL tree animation applet

Recitation 4, AVL Trees (Balanced Binary Search Trees)
- Hueihan's Slides [PDF ]
- Victor's Slides [PDF] | [Zipped Keynote]
- Code for AVL Trees: coming as soon as Victor wakes up

Revision as of 17:29, 21 February 2008 (view source) Mathmike (Talk \| contribs) ← Older edit		Revision as of 16:48, 22 February 2008 (view source) Hueihan (Talk \| contribs) Newer edit →
Line 34:		Line 34:

	* [[Recitation 5]] Hashing in Python, Mutability		* [[Recitation 5]] Hashing in Python, Mutability
		+	** Hueihan's Slides [[http://courses.csail.mit.edu/6.006/spring08/recitation_notes/PythonHashing.pdf PDF ]]