Note: PPT = power point, PS = postscript, PDF = portable document format
x/1 means "x slides on 1 page".
To read PDF files, click

If a particular day's lecture note is not available, then it should be understood that the most recent note covers that day also.

Week Files Available
PDF 1/1
1. Aug 31 --
  • Intro. to CSE 431/531,
  • Growth of functions, asymptotic notations,
  • Solving recurrences, Master theorem.
  • 2. Sep 07 --
    3. Sep 14 --
  • Divide & conquer, featuring quick sort, merge sort, order statistics, matrix multiplication
  • A note on writing proofs about asymptotic relations
  • 4. Sep 21 --
    5. Sep 28 --
  • Fast Fourier Transform featuring polynomial multiplication
  • 6. Oct 05 --
  • Introduction to the greedy method: activity selection, fractional knapsack, Huffman coding
  • Matroids and minimum spanning trees
  • Dijkstra's algorithm, other scheduling problems
  • 7. Oct 12 --
    8. Oct 19 --
    9. Oct 26 -- Dynamic programming:
  • Longest common subsequence and matrix-chain multiplication
  • Assembly-line scheduling and Optimal binary search tree.
  • Floyd-Warshall algorithm for All Pairs Shortest-Paths
  • 10. Nov 02 --

    11. Nov 09 --

    12. Nov 16 --
  • Introduction to NP-Completeness
  • A Tutorial on NP-Completeness (postscript - last updated on Fri Nov 19.)
  • Introduction to Approximation Algorithms
  • 13. Nov 23 --
    14. Nov 30 --
    15. Dec 07 -- Open topic. Possibly an AQA session ala Don Knuth & a review for the final exam.

    Home | Announcements | Schedule | Assignments | Syllabus | Helpful Links