Schedule

Week 1 (Jan 25, 27):

• Topics: Class intro. Warmup with searching (linear and binary) and sorting (bubble sort, insertion sort, selection sort). The RAM model. Asymptotic analysis and asymptotic notation. Case studies.
• Notes: 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

Week 2 (Feb 2 , 4):

• Topics: Analysis tools: Summations. Mergesort.
• Notes: Summations.pdf | e1 | Recurrences.pdf | e1 | e2 | e3 | e4
• Internet: Python visualization | all sorts
• Reading: CLRS A, 2.3, 4.4
• Lab: [lab cancelled]

• Topics: Analysis tools: Recurrences. Heaps.
• Notes: Heaps.pdf | e1
• Internet:
• Reading: CLRS 6
• Lab: Lab 2 (recurrences and heaps)

• Topics: Heapsort. Quicksort.
• Notes: Quicksort.pdf | e1
• Internet:
• Reading: CLRS 6, 7
• Lab: Lab 3 (quicksort, sorting)

• Topics: Sorting lower bound. Sorting in linear time. Selection.
• Notes: sortLB.pdf | e2 | linsort.pdf | Selection.pdf | e1
• Internet:
• Reading: CLRS 8, 9
• Lab: Lab 4 (more sorting: programming!) (due March 10th)

• Topics: Binary search trees and balanced BSTs.
  Thu March 3rd: Exam 1 (covers everything up to and including linear time sorting)
• Notes: bst.pdf | rb.pdf
• Internet:
• Reading:
• Lab: Lab 5 (selection) (due March 10th)

• Topics: Red-Black trees. Divide-and-conquer algorithms (Strassen, maximum sub-array)
• Notes: rbtrees.pdf | Divide-and-conquer.pdf | Max-subarray.pdf
• Internet: MIT Open courseware RB-tree slides
• Reading: CLRS 4.1, 4.2
• Lab: Lab 6 (techniques: D&C) (due Friday 4/1)

SPRING BREAK

Week 8 (March 29, 31):

• Topics: Dynamic programming.
• Notes: BoardGame.pdf | Rod.pdf
• Internet:
• Reading: CLRS 15.1, 15.4
• Lab: LCS (in-class) | Lab 7 (dynamic programming) (due Friday 4/8)

Week 9 (April 5, 7):

• Topics: Dynamic programming and greedy algorithms.
• Notes: Greedy.pdf
• Internet:
• Reading: CLRS 15.4, 16.1, 16.2
• Lab : Lab 8 (dynamic programming and greedy) (due Tuesday 4/19)

Week 10 (April 12, 14, 15):

• Topics: Graphs basics, BFS, DFS.
  Thu April 14th: Exam 2 (covers selection, divide and conquer, dynamic programming ad greedy)
• Notes: Basics.pdf | BfsDfs.pdf | Applications.pdf
• Reading: CLRS 22.1 - 22.3
• Internet: Lecture slides by Kevin Wayne.

Week 11 (April 19, 21, 22):

• Topics: Graphs: Topological sort. Strongly connected components.
• Notes: topsort.pdf | SCC.pdf
• Internet:
• Reading: CLRS 22.4, 22.5
• Lab: Lab 9 (graphs) (due Fri 4/29) | In-class: KevinBaconGame.pdf

Week 12 (April 26, 28, 29):

• Topics: Graphs: Minimum spanning tree (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 10 (graphs) (due Fri 5/6)

Week 13 (May 3, 5, 6):

• Topics: Graphs: Single-source shortest paths (Bellman-Ford and Dijkstra's algorithms). Crash course into NP-completeness.
• Notes: sp.pdf
• Internet: Dijkstra demo by Kevin Wayne. | Lecture slides by Kevin Wayne.
• Reading:CLRS 24.1-24.3
• Lab: Lab 11 (in-class only)

Week 14 (May 10):

• Topics: Algorithmic questions in technical interviews.
• Notes:
• Internet: