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.
- Jan. 19 -- Introduction
- Jan. 21 -- Introduction
to CS and Its Methods of Inquiry
- Jan. 24 -- Algorithm
Design with Objects
- Jan. 26 -- Introduction
to Theory
- Jan. 28 -- Experimentation
- Jan. 31 -- Experimentation,
Part 2
- Feb. 2 -- Introduction
to Recursion
- Feb. 4 -- Recursion,
Part 2
- Feb. 7 -- Intermediate
Recursion
- Feb. 9 -- Introduction
to Induction
- Feb.
11 -- Induction and Algorithms, Part 1
- Feb. 14 -- Induction
and Algorithms, Part 2
- Feb. 16 -- Introduction
to Recurrence Relations
- Feb. 18 -- Recurrence
Relations and Algorithms, Part 1
- Feb. 21 -- Recurrence
Relations and Algorithms, Part 2
- Feb. 23 -- Guest
Lecture
- Feb. 25 -- Guest
Lecture
- Feb. 28 -- Asymptotic
Notation
- Mar. 2 -- Introduction
to Lists
- Mar. 4 -- Hour
Exam 1
- Mar. 7 -- List
Algorithms
- Mar. 9 -- List
Algorithms and List Subclasses
- Mar. 11 -- Algorithm
Design and Analysis with Lists, Part 1
- Mar. 21 -- Designing
and Analyzing Bubble Sort, Part 2
- Mar. 23 -- Execution
Time of Bubble Sort
- Mar. 25 -- Execution
Time of Bubble Sort, Part 2
- Mar. 28 -- Introduction
to Stacks
- Mar. 30 -- Alternative
Design for Class Stack
- Apr. 4 -- Hour
Exam 2
- Apr. 6 -- Introduction
to Trees
- Apr. 8 -- Ordered
Trees
- Apr. 11 -- Analyzing
Tree Traversals
- April 13 -- Performance
of Tree Searches
- Apr. 15 -- Deleting
from Ordered Trees
- Apr. 18 -- Exponential
Time
- Apr. 20 -- Lower
Bounds
- Apr. 25 -- Open
Problems Concerning Lower Bounds
- Apr. 27 -- The
Halting Problem
- Apr. 29 -- Undecidability
- May 2 -- Undecidability,
Part 2