Lectures and Recitations

From 6.006 Wiki

Revision as of 02:47, 12 December 2008 by Wrightc (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Contents

PNG versions of the PDFs, if you're having trouble opening them: http://courses.csail.mit.edu/6.006/fall08/notes/png/

Introduction and Document Distance

Lecture 1, Introduction and Document Distance

Recitation 1

Lecture 2, Document Distance, Mergesort

Recitation 2 : maximum sum contiguous subarray problem


Binary Search Trees

Lecture 3, Binary Search Trees

  • runway.py code from class
  • Readings: CLRS Chapter 10; Chapter 12, Sections 1-3

Recitation 3

Lecture 4 : AVL trees (Balanced BSTs)

Recitation 4


Hashing

Lecture 5 : Hashing I

Readings: CLRS 11.1-11.3

Recitation 5

Lecture 6 : Hashing II

Readings: CLRS 17, 32.2

Recitation 6

Lecture 7 : Hashing III

Readings: CLRS 11.4, 11.3.3, 11.5

Recitation 7


Sorting

Lecture 8 : Insertion, Merge, and Heap Sort

Recitation 8

Lecture 9 : more heaps(heapsort, building), priority queues

Recitation 9

Lecture 10 : Decision tree - lower bounds on sorting, counting sort

Recitation 10

Lecture 11 : Radix sort

Quiz 1 Review (Recitation 11)


Searching

Lecture 12 : Intro to Searching, Graphs, small Rubiks problem

Rectation 12 (canceled)

Lecture 13 : Graph Searching : BFS, DFS

Recitation 13

Lecture 14 : Graph Searching II : DAGs, topological sort

Recitation 14



Shortest Paths

Lecture 15 : Intro Shortest Paths : weighted graphs & general structure

Recitation 15

Lecture 16 : Shortest Paths II : Bellman-Ford

Recitation 16

Lecture 17 : Shortest Paths III : Dijkstra

Recitation 17

Lecture 18 : Shortest Paths IV : further improvements



Dynamic Programming

Lecture 19 : Dynamic Programming I : Introduction

Recitation 19 : Quiz review

  • review packet
  • see quiz prep

Lecture 20 : Dynamic Programming II : Longest Common Subsequence

Recitation 20

  • The 0-1 Knapsack problem

Lecture 21 : Dynamic Programming III : Image Resizing, Matrix Chain Multiplication

Recitation 21

Lecture 22 : Dynamic Programming IV

Recitation 22



Computability Theory

Lecture 23 : Computability I : Reductions

Recitation 23



Numerics

Lecture 24 : Numerics I : Linear Equations and Least Squares

Recitation 24

Lecture 25 : Numerics II : Givens Rotation

Recitation 25



Beyond 6.006

Lecture 26 : Beyond 6.006

  • a.k.a. "Things You Don't Have To Know For The Final Exam"

Recitation 26

Personal tools