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 | greedy.pdf | amortization.pdf
• basicgraph.pdf | shortestpaths.pdf | mst.pdf
• finalReview.pdf

• growth | summations | Recurrences1 | Recurrences2 | Quicksort | Heapsort | Selection | Divide and conquer

• Graphs-basics.pdf | Graphs-sp.pdf | Graphs-mst.pdf

Schedule

	Thursday 9/5: Introduction and mathematical review. Reading: textbook ch 1
Tuesday 9/10: Asymptotic notation. Sorting (bubblesort, selection sort). Reading: textbook 2.4.2 | Prologue	Thursday 9/12: Insertion sort, mergesort. Reading: textbook 4.1
Tuesday 9/17: Analyzing mergesort. Recurrence relations. Example	Thursday 9/19:
Tuesday 9/24: Quicksort. Reading: textbook 4.3	Thursday 9/26 Priority queues: Heaps. Heapsort. Reading: textbook 2.4
Tuesday 10/1: Sorting lower bound. Linear time sorting (bucket sort, radix sort). Reading: textbook 4.4,4.5,4.6	Thursday 10/3: Selection. Reading: textbook 4.7
Tuesday 10/8: Review and problems.	Thursday 10/10: EXAM 1.
Tuesday 10/15: FALL BREAK.	Thursday 10/17: Divide-and-conquer (Strassen's algorithm, (large) integer multiplication). Reading: textbook 5.2
Tuesday 10/22: Dynamic programming (matrix multiplication, 0-1 knapsack) Reading: textbook 5.1	Thursday 10/24: Dynamic programming (job scheduling)
Tuesday 10/29: Greedy algorithms (activity selection, fractional knapsack). Reading: textbook 5.3	Thursday 10/31: Graph basics. Reading: textbook 6.2, 6.3
Tuesday 11/5: Problem session.	Thursday 11/7: EXAM 2.
Tuesday 11/12: Graph traversals (BFS, DFS) Reading: textbook 6.2, 6.3	Thursday 11/14: Digraphs. Strong components. Transitive closure. Topological order. Reading: textbook 6.4
Tuesday 11/19: Shortest paths (SSSP). Reading: textbook 7.1, 7.2	Thursday 11/21: MST (Kruskal, Prim) Reading: textbook 7.3
Tuesday 11/26: MST	Thursday 11/28: THANKSGIVING BREAK.
Tuesday 12/3: NP-Completeness. Reading: textbook 13	Thursday 12/5: NP-Completeness.
Tuesday 12/10: Round-up.

The third exam will be take-home, due on December 16th at 2pm.