SUNY Geneseo, Department of Computer Science


Lecture Record

CSci 141 , Fall 2004

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. Aug. 31 -- Introduction
  2. Sept. 2 -- Introduction to Design
  3. Sept. 7 -- Introduction to Theory
  4. Sept. 9 -- Experimentation
  5. Sept. 14 -- Boolean Logic
  6. Sept. 16 -- Introduction to Recursion
  7. Sept. 21 -- Recursion, Part 2
  8. Sept. 23 -- Introduction to Induction
  9. Sept. 28 -- Induction and Algorithms
  10. Sept. 30 -- Introduction to Recurrence Relations
  11. Oct. 5 -- Recurrence Relations and Recursive Algorithms
  12. Oct 7 -- Hour Exam 1, no lecture
  13. Oct. 19 -- Asymptotic Notation
  14. Oct. 21 -- Introduction to Lists
  15. Oct. 26 --List Subclasses
  16. Oct. 28 -- Correctness of Bubble Sort in Lists
  17. Nov. 2 -- Performance Analysis of List Bubble Sort
  18. Nov. 4 -- Stacks
  19. Nov. 9 -- Hour Exam 2, no lecture
  20. Nov. 11 -- Introduction to Trees
  21. Nov. 16 -- Ordered Binary Trees
  22. Nov. 18 -- Building and Searching Ordered Binary Trees
  23. Nov. 23 -- Performance of Ordered Binary Trees
  24. Nov. 30 -- Exponential-Time Algorithms
  25. Dec. 2 -- Optimality
  26. Dec. 7 -- The Halting Problem
  27. Dec. 9 -- Undecidability, Part 2