Lecture Notes -- Fall 2000
| Lecture | Date | Topic | Reading | Download |
| 1 | R 8/28 | Welcome to CS100 (J&M), Course Info | Lewis &Loftus Chapter 1 | [html] |
| 2 | T 8/29 | Variables and declarations, assignment, expressions, Java constructs |
L&L
Chapter 2 and Sections 3.1-3.5 |
[html] |
| 3 | R 8/31 | Iteration, while loops | L&L Sections 3.6-3.7 | [html] |
| 4 | T 9/5 | Programming concepts, rules of thumb, casting. | L&L
Section 3.9 |
[html] |
| 5 | R 9/7 | Programming by stepwise refinement, use of comments as higher-level statements | No readings | [html] |
| 6 | T 9/12 | Computation and computational power, abstraction, classes, objects, methods, references, and aliases | L & L, Chapter 4 and Section 5.1 | [html] |
| 7 | R 9/14 | Classes, objects, methods, accessors, encapsulation | No readings | [html] |
| 8 | T 9/19 | Defining constructors, chaining objects, searching, the "static" modifier | L & L, Section 5.2 | [html] |
| 9 | R 9/21 | Client-server model of program structure | No readings | [html] |
| 10 | T 9/26 | Scope of names and the lifetimes of variables | No readings | [html] |
| 11 | R 9/28 | Arrays and indexing, incrementing, for loops | L & L Sections 3.8 and 6.1-6.2 | [html] |
| 12 | T 10/3 | for statement, throw, exception handling | No additional readings | [html] |
| 13 | R 10/5 | Additional material on the use of arrays and alternate implementations of a class | No additional readings | [html] |
| T 10/10 | Fall Break | |||
| 14 | R 10/12 | Sorting, loop invariants | No additional readings | [html] |
| 15 | T 10/17 | Binary search, asymptotic complexity | No additional readings | [html] |
| 16 | R 10/19 | Two-dimensional arrays | L & L Section 6.3 | [html] |
| 17 | T 10/24 | Two-dimensional arrays, comments as high-level specifications, use of sentinels, heuristic algorithms | No additional readings | [html] |
| 18 |
R 10/26 |
Representation Rules of Thumb | No additional readings | [html] |
| 19 | T 10/31 | Matlab, this as a constructor | CS100 MatLab Syllabus | [html] |
| 20 | R 11/2 | Matlab and its implementation cont'd. | CS100 MatLab Syllabus | [html] |
| 21 | T 11/7 | Program 5 Discussion | No additional readings | |
| 22 | R 11/9 | Matlab demonstration | No additional readings | [html] |
| 23 | T 11/14 | Inheritance, method overriding, polymorphism | L & L, Chapter 7 | [html] |
| 24 | R 11/16 | Application of inheritance, higher order methods, abstract classes, the protected modifier | No additional readings | [html] |
| 25 | T 11/21 | More inheritance: super (and also introduction to graphics) | Re-read: L & L, Section 5.4 |
 [html] |
| R 11/23 | Thanksgiving | |||
| 26 | T 11/28 | Analysis of algorithms and their complexity, asymptotic complexity, (worst, best, average) case analysis, recursion | No additional readings | [html] |
| 27 | R 11/30 | What can be computed? What can not be computed? Can human capabilities be matched? | No additional readings | [html] |