SUNY Geneseo, Department of Computer Science


Lecture Record

CSci 141 , Spring 2005

Prof. Doug Baldwin

Caveat:

These are electronic records of class discussion from CSci 141 (Introduction to Computer Science). 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. 19 -- Introduction
  2. Jan. 21 -- Introduction to CS and Its Methods of Inquiry
  3. Jan. 24 -- Algorithm Design with Objects
  4. Jan. 26 -- Introduction to Theory
  5. Jan. 28 -- Experimentation
  6. Jan. 31 -- Experimentation, Part 2
  7. Feb. 2 -- Introduction to Recursion
  8. Feb. 4 -- Recursion, Part 2
  9. Feb. 7 -- Intermediate Recursion
  10. Feb. 9 -- Introduction to Induction
  11. Feb. 11 -- Induction and Algorithms, Part 1
  12. Feb. 14 -- Induction and Algorithms, Part 2
  13. Feb. 16 -- Introduction to Recurrence Relations
  14. Feb. 18 -- Recurrence Relations and Algorithms, Part 1
  15. Feb. 21 -- Recurrence Relations and Algorithms, Part 2
  16. Feb. 23 -- Guest Lecture
  17. Feb. 25 -- Guest Lecture
  18. Feb. 28 -- Asymptotic Notation
  19. Mar. 2 -- Introduction to Lists
  20. Mar. 4 -- Hour Exam 1
  21. Mar. 7 -- List Algorithms
  22. Mar. 9 -- List Algorithms and List Subclasses
  23. Mar. 11 -- Algorithm Design and Analysis with Lists, Part 1
  24. Mar. 21 -- Designing and Analyzing Bubble Sort, Part 2
  25. Mar. 23 -- Execution Time of Bubble Sort
  26. Mar. 25 -- Execution Time of Bubble Sort, Part 2
  27. Mar. 28 -- Introduction to Stacks
  28. Mar. 30 -- Alternative Design for Class Stack
  29. Apr. 4 -- Hour Exam 2
  30. Apr. 6 -- Introduction to Trees
  31. Apr. 8 -- Ordered Trees
  32. Apr. 11 -- Analyzing Tree Traversals
  33. April 13 -- Performance of Tree Searches
  34. Apr. 15 -- Deleting from Ordered Trees
  35. Apr. 18 -- Exponential Time
  36. Apr. 20 -- Lower Bounds
  37. Apr. 25 -- Open Problems Concerning Lower Bounds
  38. Apr. 27 -- The Halting Problem
  39. Apr. 29 -- Undecidability
  40. May 2 -- Undecidability, Part 2