Schedule

Week 1: Jan 24, 26:

• Topics: Class intro. Warmup with sorting (bubble sort, insertion sort, selection sort). Asymptotic analysis and asymptotic notation.
• Notes: overview.pdf | Intro.pdf | bbsort.pdf | selsort.pdf | inssort.pdf | Analysis.pdf | running times | e1 | e2
• Internet: check out slides by Kevin Wayne at Princeton intro | analysis
• Reading: CLRS 1, 2, 3
• Lab: Lab 1 (asymptotic analysis) | Guidelines for a great problem set

Week 2: Jan 31, Febr 2:

• Topics: Summations. Recurrences. Mergesort.
• Notes: Summations.pdf | ex-sum | Recurrences.pdf | rec1 | rec1-solution | rec2 | rec3 | rec4
• Internet: Python visualization | all sorts
• Reading: CLRS A, 2.3, 4.4
• Lab: Lab 2 (recurrences)

• Topics: Heaps and heapsort. Quicksort.
• Notes: Heaps.pdf | ex | Quicksort.pdf | ex
• Internet:
• Reading: CLRS 6, 7
• Lab: Lab 3 (heaps, quicksort)

• Topics : Sorting lower bound. Sorting in linear time.
• Notes : sortLB.pdf | ex | linsort.pdf
• Internet:
• Reading: CLRS 8, 9
• Lab: Lab 4 (sorting)

Week 5: Febr 21, 23, 24:

• Topics : Selection.
• Notes : Selection.pdf | ex
• Internet:
• Reading: CLRS 9
• Lab: [lecture in place of lab]

• Tue 2/28: Exam 1 (covers everything up to and including linear-time sorting)
• Topics: Divide-and-conquer algorithms (Karatsuba's integer multiplication, Strassen)
• Notes: Strassen.pdf
• Slides:
• Reading: CLRS 4.1, 4.2
• Lab: Lab 5 (selection) due Friday 3/10

Week 7: March 7, 9, 10

• Topics: Divide-and-conquer algorithms (maximum partial sum). Binary search trees (review) and Red-black trees. [Augmented RB trees. Skip lists] (class cancelled, Laura at SIGCSE)
• Notes: Max-subarray.pdf | bst.pdf | rb.pdf skiplists.pdf
• Slides: BinarySearchTrees
• Internet: MIT Open courseware RB-tree slides
• Reading: CLRS 4.1, 4.2
• Lab: Lab 6 (divide-and-conquer) due Friday 3/31

!!SPRING BREAK!!!

Week 8: March 28, 30, 31:

• Topics: Dynamic programming.
• Notes: BoardGame.pdf | Rod.pdf
• Internet:
• Reading: CLRS 15.1, 15.4
• Lab: Lab 7 (dynamic programming)

Week 9: April 4, 6, 7:

• Topics: More dynamic programming.
• Notes: Knapsack | LCS | Weighted interval scheduling
• Internet:
• Reading: CLRS 15.1, 15.4
• Lab: Lab 8 (dynamic programming)

Week 10: April 11, 13, 14:

• Topics: Greedy algorithms. Graphs: graph basics and traversals (BFS, DFS).
• Notes: ActivitySelection.pdf | Basics.pdf | BfsDfs.pdf
• Internet: Lecture slides by Kevin Wayne.
• Reading: CLRS 16.1, 16.2, CLRS 22.1 - 22.3
• Lab: Exam 2 (covers selection, divide and conquer and dynamic programming and greedy).

Week 11: April 18, 20, 21:

• Topics: Traversal applications. Topological sort. Strongly connected components in linear time
• Notes: traversal-applications.pdf | topsort.pdf | scc.pdf
• Internet:
• Reading: CLRS 22.4
• Lab: Lab 9 (graphs I)

Week 12: April 25, 27, 28

• Topics: Shortest paths: SP in DAGs. Bellman-Ford and Dijkstra's algorithms.
• Notes: shpaths.pdf
• Internet: Dijkstra demo by Kevin Wayne.
• Reading: CLRS chapter 24.1, 24.2, 24.3
• Lab: Lab 10 (graphs II)

Week 13: May 2, 4, 5

• Topics: Minimum spanning trees (Kruskal and Prim's algorithms). Union-find structure).
• Notes: MST.pdf
• Internet: Lecture slides | Kruskal demo | Prim demo by Kevin Wayne
• Reading: CLRS 23
• Lab: Lab 11 (graphs III)

Week 14: May 9

• Topics: Review and algorithmic questions from technical interviews.
• Notes: review.pdf
• Internet: Lecture slides by Kevin Wayne.
• Reading:
• Lab:

Exam 3 will be on Friday May 18th, 2-5pm, in Searles 128.