SUNY Geneseo, Department of Computer Science


Lecture Record

Csci 141 , Fall 2003

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. 25 -- Introduction
  2. Aug. 27 -- CS Methods of Inquiry
  3. Aug. 29 -- Object Oriented Programming Concepts
  4. Sep. 3 -- Object Oriented Programmming Concepts, Part 2
  5. Sep. 5 -- Introduction to Theory
  6. Sep. 8 -- Introduction to Science
  7. Sep. 10 -- Conditionals and Logic
  8. Sep. 12 -- Introduction to Recursion
  9. Sep. 15 -- Recursion, Part 2
  10. Sep. 17 -- Recursion, Part 3
  11. Sep. 19 -- Recursion, Part 4
  12. Sep. 22 -- Introduction to Induction
  13. Sep. 24 -- Induction, Part 2
  14. Sep. 26 -- Induction and Recursion
  15. Sep. 29 -- Induction and Recursion, Part 2
  16. Oct. 1 -- Another Induction Example
  17. Oct. 6 -- Text Files in Java
  18. Oct. 8 -- Introduction to Recurrence Relations
  19. Oct. 10 -- Exam 1
  20. Oct 15 -- Recurrence Relations for Analyzing Algorithms
  21. Oct. 17 -- Recurrence Relations for Analyzing Algorithms, Part 2
  22. Oct. 20 -- Introduction to Lists
  23. Oct. 22 -- Lists as Data Sets, Part 1
  24. Oct. 24 -- List Search and Delete Algorithms
  25. Oct. 27 -- Performance of List Algorithms
  26. Oct. 29 -- Correctness of List Algorithms
  27. Oct. 31 -- Correctness of List Algorithms, Part 2
  28. Nov. 3 -- Introduction to Binary Trees
  29. Nov. 5 -- Binary Tree Search
  30. Nov. 7 -- Analysis of Tree Search
  31. Nov. 10 -- The Height and Size of Binary Trees
  32. Nov. 12 -- Recurrence Relations for Tree Traversals
  33. Nov. 14 -- Tree Traversal
  34. Nov. 17 -- Analysis of Alternative Height Algorithms
  35. Nov. 19 -- Exam 2
  36. Nov. 21 -- Stack Implementations, Tree Insertion
  37. Nov. 24 -- Lower Bounds
  38. Dec. 1 -- Intractability and Factoring
  39. Dec. 3 -- Cryptography
  40. Dec. 5 -- Cryptography Examples
  41. Dec. 8 -- The Halting Problem