Lectures and Recitations
From 6.006 Wiki
(Difference between revisions)
m |
|||
| Line 18: | Line 18: | ||
* [https://courses.csail.mit.edu/6.006/fall08/handouts/protected/Bentley.pdf Jon Bentley's column on the maximum sum contiguous vector problem discussed in class] | * [https://courses.csail.mit.edu/6.006/fall08/handouts/protected/Bentley.pdf Jon Bentley's column on the maximum sum contiguous vector problem discussed in class] | ||
* [[Recitation02 Notes]] | * [[Recitation02 Notes]] | ||
| - | + | *[http://courses.csail.mit.edu/6.006/fall08/notes/r02-notes.pdf R02] warmup problems | |
=== Binary Search Trees === | === Binary Search Trees === | ||
| Line 27: | Line 27: | ||
==== Recitation 3 ==== | ==== Recitation 3 ==== | ||
* [[Recitation03 Notes]] | * [[Recitation03 Notes]] | ||
| + | *[http://courses.csail.mit.edu/6.006/fall08/notes/r03-notes.pdf R03] notes & warmup problems | ||
Revision as of 18:06, 16 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
- R02 warmup problems
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
- R03 notes & warmup problems
