Syllabus

Useful links, animations, etc:

• MIT open courseware
• Algortithms textbook by Dasgupta, Papadimitriou and Vazirani online
• Sorting animations: all sorts | Progr.pearls
• Zeno's paradoxes
• Mathematical induction:
  • Mathematical induction (Robert Plummer, Stanford)
  • Mathematical induction (V. Adamchik, CMU)
  • Mathematical induction(Tom Davis, Utah)
  • Mathematical induction (TheMathPage)
  • Induction(YouTube)
• Mergesort (Princeton)
• Demo-partition (Princeton
• Divide-and-conquer (Princeton) | Matrix multiplication (Princeton)
• Graph vizualizations (Princeton)| CC | BFS | DFS
• Dijkstra/MST animation | another Dijkstra animation | Slides (Princeton) | UnionFind (Princeton)
• Fun read: Pessimal algorithms (Broder, Stolfi)
• Complexity
  • Longest path
  • Complexity (lecture by E. Demaine)
  • P vs NP problem(Lecture by M. Sipser, Clay Institute, hosted at Harvard 2006)
  • P=NP(Erik Demaine proves P=NP)

Other undergraduate algorithm classes on the web:

• Wellesley: CS231-spring 2013 (Tjaden)
• MIT Open CourseWare: ALgorithms
• MIT: fall 06 (Demaine, Sudan) | Fall 2002 (Demaine, Goldwasser)
• Stanford: summer 2013 (Schwartz) | Spring 2002 (Guibas)
• Yale: Spring 2003 (Aspnes)
• CMU: Spring 2002 (Blelloch, Miller)
• Princeton: Spring 2002 (Sedgewick, Wayne)
• Duke: Fall 1996 (Agarwal)
• Dartmouth: Fall 2007 | Fall2003
• Cornell: Summer 2003 | Spring2003 | Spring 2000 (Chew)

• intro.pdf | growth.pdf | summations.pdf | recurrences.pdf
• divide-and-conquer.pdf | quicksort.pdf | sortLB.pdf
• selection.pdf | heaps.pdf
• bst.pdf | RBtrees.pdf | augtrees.pdf | skiplists.pdf | splayTrees.pdf
• dynprog.pdf |knapsack.pdf | matrixhain.pdf | greedy.pdf | amortization.pdf
• basicgraph.pdf | shortestpaths.pdf | mst.pdf
• finalReview.pdf

Tentative schedule

1/21, 1/23, 1/28	Introduction and mathematical review. Asymptotic notation. Sorting (bubble sort, selection sort, insertion sort, mergesort). Reading: CLRS ch. 1, 2.1, 2.2, 3 | Prologue Exercises: ex-growth | ex-summations
1/30, 2/4	Recurrence relations. Reading: CLRS ch. 4 Exercises: ex-recurrences-1 | ex-recurrences-2
2/6	Quicksort. Reading: CLRS chap 7 Exercises: ex-quicksort
2/11	Priority queues: binary heap. Heapsort. Reading:CLRS chap 6 Exercises: ex-heapsort
2/13	Sorting lower bound. Linear time sorting (bucket sort, radix sort). Reading: CLRS chap 8 Exercises:
2/18	Selection. Reading: CLRS chap 9 Exercises: ex-selection
2/20, 2/25	Problems. EXAM 1. Reading: Exercises:
2/27	Divide-and-conquer (Strassen's algorithm, large integer multiplication). Reading: CLRS chap 4 Exercises: ex-divideandconquer
3/4, 3/6	Dynamic programming (matrix chain multiplication, 0-1 knapsack, job scheduling). Reading: CLRS chap 15 Exercises:
3/25	Greedy algorithms (activity selection, fractional knapsack). Reading: CLRS chap 16 Exercises:
3/27	Problems. EXAM 2. Reading: divide-and-conquer, dynamic programming and greedy techniques. Exercises:
4/1, 4/3	Graph basics. Traversals. Reading: CLRS chap 22 Slides: Graphs-basics.pdf Exercises:
4/8, 4/10	Digraphs. Strongly connected components. Transitive closure. Topological ordering. Reading: CLRS chap 22 Slides: Graphs-basics.pdf Exercises:
4/15, 4/17	Shortest paths (SSSP). Dijkstra's algorithm and Bellman-Ford's algorithm. Reading: CLRS chap 24 Slides: Graphs-sp.pdf Exercises:
4/22	Minimum spanning tree (MST). Reading: CLRS chap 23 Slides: Graphs-mst.pdf Exercises:
4/24	String algorithms. Reading: CLRS chap 32 Exercises:
4/29, 5/1	NP-completeness. Reading: CLRS chap 33 Exercises:
5/6	Round-up. Reading: Exercises:
5/13	EXAM 3. Reading: Graphs and NPC.

The third exam will be take-home, due on May 13th at 12pm.