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