SUNY Geneseo, Department of Computer Science


Lecture Record

CSci 141 , Spring 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. Jan. 13 -- Introduction
  2. Jan. 15 -- Object Oriented Programming Concepts
  3. Jan. 20 -- Proofs and Algorithms
  4. Jan. 22 -- Overview of the Scientific Method
  5. Jan. 27 -- Conditionals and Logic
  6. Feb. 3 -- Introduction to Recursion
  7. Feb. 5 -- Recursion, Part 2
  8. Feb. 10 -- Introduction to Induction
  9. Feb. 12 -- Induction and Algorithms, Part 1
  10. Feb. 17 -- Induction and Algorithms, Part 2
  11. Feb. 19 -- Introduction to Recurrence Relations
  12. Feb. 24 -- Practice with Recurrence Relations
  13. Feb. 26 -- Designing Binary Search
  14. Mar. 2 -- Hour Exam 1, no lecture
  15. Mar. 16 -- Correctness of Binary Search
  16. Mar. 18 -- Execution Time of Binary Search
  17. Mar. 23 -- Introduction to Lists
  18. Mar. 25 -- List Algorithms
  19. Mar. 30 -- Creating Subclasses of List
  20. Apr. 1 -- Hour Exam, no lecture
  21. Apr. 6 -- Stacks
  22. Apr. 8 -- Introduction to Trees
  23. Apr. 13 -- Tree Algorithms
  24. Apr. 15 -- Ordered Trees
  25. Apr. 20 -- The Halting Problem