CSE logo University of Washington Computer Science & Engineering
 CSE 421 Lecture Videos
  CSE Home   About Us    Search    Contact Info 

 Webviewer
   

CSE 421, Autumn 2006, Recorded Lectures

Recorded lectures should be viewed with version 1.9.95 (or later of Web Viewer). Lectures are available as zip files (of size about 100M per lecture). To view a lecture, download it to your machine, unzip it, launch the WebViewer application, and with File-> Open File navigate to "OpenWithWebViewer" in the lecture directory.

Lectures

  • Lecture 0 8/30/06, Five Problems, Text, Section 1.2. This was an introductory lecture shown in Beihang that is optional viewing for UW.
  • Lecture 1 9/27/06, Introduction to Stable Matching. Section 1.1.
  • Lecture 2 9/29/06, (recorded 9/27/06) Stable Matching.
  • Lecture 3 10/2/06, Models of computation. (Student activity lecture). Sections 2.1, 2.2.
  • Lecture 4 10/4/06, Graph theory, Chapter 3
  • Lecture 5 10/6/06, Graph theory, Chapter 3
  • Lecture 6 10/9/06, Greedy algorithms, Section 4.1. (Activity Lecture)
  • Lecture 7 10/11/06, Greedy algorithms, Section 4.2.
  • Lecture 8 10/13/06, Dijkstra's algorithm, Sections 4.3 and 4.4.
  • Lecture 9 10/16/06, Minimum Spanning Tree Section 4.5 (Activity Lecture).
  • Lecture 10 10/18/06, Minimum Spanning Tree Sections 4.5, 4.7
  • Lecture 11 10/20/06, Recurrences, Sections 5.1 and 5.2
  • Lecture 12 10/23/06, Recurrences, Sections 5.1 and 5.2 (Activity Lecture)
  • Lecture 13 10/25/06, Divide and Conquer, Sections 5.3 and 5.4
  • Lecture 14 10/27/06, Divide and Conquer, Sections 5.5 and 5.6
  • Lecture 15 10/30/06, Fast Fourier Transform, Section 5.6
  • Lecture 16 11/1/06, Dynamic Programming 6.1, 6.2, 6.3 (Activity Lecture)
  • Lecture 17 11/6/06, Subset Sum, Section 6.3, 6.4
  • Lecture 18 11/8/06, Dynamic Programming Examples, Ch 6, Solved Exercises 1 and 2 (Activity Lecture)
  • Lecture 19 11/13/06 (Recorded 11/6/06), Longest Common Subsequence, Section 6.6
  • Lecture 20 11/15/06, (Recorded 11/8/06), Memory Efficient LCS, Section 6.7
  • Lecture 21 11/17/06, (Recorded 11/20/06), Shortest Paths, Sections 6.8 and 6.10
  • Lecture 22 11/20/06, Network Flow, Section 7.1 (Activity Lecture)
  • Lecture 23 11/22/06, Network Flow - MaxFlow, MinCut theorem, Section 7.2
  • Lecture 24 11/27/06, Network Flow Applications, Sections 7.5-7.7
  • Lecture 25 11/29/06, Open Pit Mining (MinCut Application) (Activity Lecture)
  • Lecture 26 12/1/06, Network Flow Applications Sections 7.9, 7.10, 7.11
  • Lecture 27 12/4/06, NP Completeness, Chapter 8.
  • Lecture 28 12/6/06, NP Completeness, Chapter 8.(Activity Lecture)
  • Lecture 29 12/8/06, NP Completeness, Chapter 8.


CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to Richard Anderson]