Lectures - CSCI 570, Summer 2011, Session Two

• Lecture 1 (PDF) (6-up PDF) (Jun 29, 2011) - administrative, hw1
• Lecture 2 (PDF) (6-up PDF) (Jun 30, 2011) - hw1
• (Jul 4, 2011) - independence day holiday
• Lecture 3 (PDF) (6-up PDF) (Jul 5, 2011) - course introduction, stable matching
• Lecture 4 (PDF) (6-up PDF) (Jul 6, 2011) - stable matching
• Lecture 5 (PDF) (6-up PDF) (Jul 7, 2011) - stable matching
• Lecture 6 (PDF) (6-up PDF) (Jul 11, 2011) - five representative problems, algorithm analysis
• Lecture 7 (PDF) (6-up PDF) (Jul 12, 2011) - hw2
• Lecture 8 (PDF) (6-up PDF) (Jul 13, 2011) - algorithm analysis, priority queues
• Lecture 9 (PDF) (6-up PDF) (Jul 14, 2011) - priority queues, graphs
• Lecture 10 (PDF) (6-up PDF) (Jul 18, 2011) - graphs, greedy algorithms basics
• Lecture 11 (PDF) (6-up PDF) (Jul 19, 2011) - greedy algorithms basics
• Lecture 12 (PDF) (6-up PDF) (Jul 20, 2011) - greedy algorithms basics, shortest path algorithms
• Lecture 13 (PDF) (6-up PDF) (Jul 21, 2011) - shortest path algorithms, minimum spanning tree
• Lecture 14 (PDF) (6-up PDF) (Jul 25, 2011) - clustering, exams, hw3, divide & conquer basics
• Lecture 15 (PDF) (6-up PDF) (Jul 26, 2011) - divide & conquer basics, closest pair of points, integer multiplication
• Lecture 16 (PDF) (6-up PDF) (Jul 27, 2011) - integer multiplication, convolution, FFT, dynamic programming basics
• (Jul 28, 2011) - midterm exam
• Lecture 17 (PDF) (6-up PDF) (Aug 1, 2011) - dynamic programming basics, sequence alignment
• Lecture 18 (PDF) (6-up PDF) (Aug 2, 2011) - sequence alignment, Bellman-Ford algorithm, network flow basics
• Lecture 19 (PDF) (6-up PDF) (Aug 3, 2011) - network flow basics, application of network flows
• Lecture 20 (PDF) (6-up PDF) (Aug 4, 2011) - application of network flows
• Lecture 21 (PDF) (6-up PDF) (Aug 8, 2011) - application of network flows

Preview:

• Lecture 21 will cover application of network flows. You can get a preview by looking at slides from Spring 2011.
• (Aug 9, 2011) - final exam (firm)

• Administrative
  • course administration (PDF) (6-up PDF)
  • exams (PDF) (6-up PDF)

• Programming Assignments
  • HW1 (PDF) (6-up PDF)
  • HW2 (PDF) (6-up PDF)
  • HW3 (PDF) (6-up PDF)

• Course Introduction (PDF) (6-up PDF)

• Stable Matching
  • first problem: stable matching (PDF) (6-up PDF)
  • five representative problems (PDF) (6-up PDF)

• Basics of Algorithm Analysis
  • algorithm analysis (PDF) (6-up PDF)
  • priority queues (PDF) (6-up PDF)

• Graphs (PDF) (6-up PDF)

• Greedy Algorithms
  • greedy algorithms basics (PDF) (6-up PDF) - interval scheduling, scheduling to minimize lateness, optimal caching
  • shortest path algorithms, coin changing, selecting breakpoints (PDF) (6-up PDF)
  • minimum spanning tree, clustering (PDF) (6-up PDF)

• Divide and Conquer
  • divide & conquer basics (PDF) (6-up PDF) - mergesort, counting inversions
  • closest pair of points, integer multiplication (PDF) (6-up PDF)
  • convolution, FFT (PDF) (6-up PDF)

• Dynamic Programming
  • dynamic programming basics (PDF) (6-up PDF) - weighted interval scheduling, segmented least squares, knapsack, RNA secondary structure
  • sequence alignment, Bellman-Ford algorithm (PDF) (6-up PDF)

• Network Flow
  • network flow basics (PDF) (6-up PDF) - max flow, min cut, Ford-Fulkerson algorithm, capacity scaling
  • application of network flows (PDF) (6-up PDF) - bipartite matching, disjoint paths, circulation with demands, survey design, airline scheduling, image segmentation, project selection, baseball elimination

• NP & Computational Intractability (Skip)
  • basic reduction strategies (PDF) (6-up PDF)
  • NP (PDF) (6-up PDF)
  • polynomial-time reduction (PDF) (6-up PDF)