Lectures and Recitations
From 6.006 Introduction to Algorithms
(Difference between revisions)
(rewrite) |
|||
| Line 2: | Line 2: | ||
** [[Document Distance]] | ** [[Document Distance]] | ||
** Readings: CLRS, Chapters 1, 2, 3. | ** Readings: CLRS, Chapters 1, 2, 3. | ||
| - | * Recitation 1, Document Distance in Python (docdist{1,2,3,4}.py) | + | * [[Recitation 1]], Document Distance in Python (docdist{1,2,3,4}.py) |
** Victor's Slides [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation01.pdf PDF]] | [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation01.zip Zipped Keynote]] | ** Victor's Slides [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation01.pdf PDF]] | [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation01.zip Zipped Keynote]] | ||
* [http://courses.csail.mit.edu/6.006/spring08/notes/lecture2.pdf Lecture 2], More Document Distance, Mergesort | * [http://courses.csail.mit.edu/6.006/spring08/notes/lecture2.pdf Lecture 2], More Document Distance, Mergesort | ||
** Readings: CLRS, Sections 11.1 and 11.2. | ** Readings: CLRS, Sections 11.1 and 11.2. | ||
| - | * Recitation 2, Python Cost Model, Review for Asymptotic Notation & Mergesort | + | * [[Recitation 2]], Python Cost Model, Review for Asymptotic Notation & Mergesort |
** Victor's Slides [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation02.pdf PDF]] | [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation02.zip Zipped Keynote]] | [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation02_data.zip Zipped Data (Numbers)]] | ** Victor's Slides [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation02.pdf PDF]] | [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation02.zip Zipped Keynote]] | [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation02_data.zip Zipped Data (Numbers)]] | ||
** [[Python Cost Model]] | ** [[Python Cost Model]] | ||
| Line 15: | Line 15: | ||
** Readings: CLRS, Chapter 10 and Sections 12.1-12.3 | ** Readings: CLRS, Chapter 10 and Sections 12.1-12.3 | ||
| - | * Recitation 3, Binary Search Trees | + | * [[Recitation 3]], Binary Search Trees |
** Victor's Slides [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation03.pdf PDF]] | [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation03.zip Zipped Keynote]] | ** Victor's Slides [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation03.pdf PDF]] | [[http://courses.csail.mit.edu/6.006/spring08/keynotes/recitation03.zip Zipped Keynote]] | ||
** Code for Binary Search Trees augmented with subtree size [[http://courses.csail.mit.edu/6.006/spring08/keynotes/bstsize_r.py Python]] | ** Code for Binary Search Trees augmented with subtree size [[http://courses.csail.mit.edu/6.006/spring08/keynotes/bstsize_r.py Python]] | ||
| Line 23: | Line 23: | ||
** Readings: CLRS, Sections 13.1 and 13.2 for a different approach (red-black trees) | ** Readings: CLRS, Sections 13.1 and 13.2 for a different approach (red-black trees) | ||
** [http://www.cs.jhu.edu/~goodrich/dsa/trees/avltree.html AVL tree animation applet] | ** [http://www.cs.jhu.edu/~goodrich/dsa/trees/avltree.html AVL tree animation applet] | ||
| + | |||
| + | * [[Recitation 4]] | ||
Revision as of 19:53, 15 February 2008
- Lecture 1, Introduction and Document Distance
- Document Distance
- 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
- 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
