SUNY Geneseo Department of Computer Science

Lecture Record

CSci 242, Spring 2013

Prof. Doug Baldwin

Caveat

These are electronic records of class discussion from CSci 242 (Analysis of Algorithms). They are generally captured as a class unfolds, and slightly cleaned up afterwards. They are not clean, carefully-planned lecture notes in the usual sense. They are more an electronic equivalent of notes on the blackboard: they record some of what the instructor said, some of what students said, the things that really happened in the class—including the misunderstandings, false starts, and similar things that happen in real classes. The goal of these notes is as much to help students remember how they learned as it is to help them remember what they learned (because the "how" of learning is at least as important as the "what").

Please make WWW or other electronic links to this page only—I want people reading these notes to see the “caveat” above.

Send comments, questions, etc. related to these notes to Doug Baldwin.

  1. Jan. 22—Introduction
  2. Jan. 24—Introduction to Graphs
  3. Jan. 29—Breadth First Search
  4. Jan. 31—Depth First Search
  5. Feb. 5—Divide and Conquer
  6. Feb. 7—Introduction to Induction
  7. Feb. 12—Induction, Part 2
  8. Feb. 14—Introduction to Recurrence Analysis
  9. Feb. 19—The Master Method
  10. Feb. 21—Introduction to Dynamic Programming
  11. Feb. 26—Trip Planning via Dynamic Programming
  12. Feb. 28—Hour Exam 1, no lecture notes
  13. Mar. 5—A Board Game Example of Dynamic Programming
  14. Mar. 7—Online Discussion, no lecture notes
  15. Mar. 12—Matrix Chain Multiplication
  16. Mar. 14—Sequence Comparison via Dynamic Programming
  17. Mar. 26—The Floyd-Warshall Algorithm
  18. Mar. 28—Dijkstra’s Algorithm
  19. Apr. 2—Greedy Algorithms
  20. Apr. 4—Minimum Spanning Trees
  21. Apr. 9—Drawing Polygons with Holes
  22. Apr. 11—Hour Exam 2, no lecture notes
  23. Apr. 16—GREAT Day, no class meeting
  24. Apr. 18—Introduction to Backtracking
  25. Apr. 23—Hash Tables
  26. Apr. 25—Probability, Expectation, and Indicator Random Variables
  27. Apr. 30—Analysis of Hashing with Chains
  28. May 2—Backtracking and the n Queens Problem
  29. May 7—Probabilistic Algorithms