CS 211 Schedule Summer 2002The notes for some classes are posted below. If there is a class for which notes are missing, it is probably because we didn't make any. We reserve the right to make changes to the schedule, because we're the boss! | |||
| Meeting | Date | Topic | |
|---|---|---|---|
| Lec. 1 | June 24 | Course Overview, Syllabus, Structural Recursion & Induction | |
| Lec. 2 | 25 | Recursion and Induction | |
| Lec. 3 | 26 | Recursion and Induction | |
| Lec. 4 | 27 | Recursion and Induction | |
| Lec. 5 | 28 | Object Oriented Programming | |
| Lec. 6 | July 1 | Encapsulation & Polymorphism | |
| Lec. 7 | 2 | Inheritance | |
| Lec. 8 | 3 | Inner & Abstract Classes, Java API, misc. | |
| Holiday! | |||
| Lec. 9 | 5 | Searching and Sorting | |
| Prelim I | 8 | Induction, Recursion, and Java | |
| Lec. 10 | 9 | Abstract Data Types | |
| Lec. 11 | 10 | Binary Trees | |
| Lec. 12 | 11 | Binary Search Trees | |
| Lec. 13 | 12 | Hashtables | |
| Lec. 14 | 15 | Stacks, Queues, etc. | |
| Lec. 15 | 16 | Priority Queues, Heaps | |
| Lec. 16 | 17 | Searching and Sorting | |
| Lec. 17 | 18 | Introduction to Algorithms | |
| Prelim II | 19 | Searching, Sorting, and ADT's | |
| Lec. 18 | 22 | Asymptotic Notation (Big-O) | |
| Lec. 19 | 23 | Algorithm Analysis | |
| Lec. 20 | 24 | Algorithm Analysis | |
| Lec. 21 | 25 | Program Correctness | |
| Lec. 22 | 26 | Mathematical Induction | |
| Lec. 23 | 29 | Introduction to Graphs | |
| Lec. 24 | 30 | Shortest Paths | |
| Lec. 25 | 31 | Graph Implementation | |
| Lec. 26 | August 1 | ||
| Lec. 27 | 2 | ||
| August 6 | Final Exam, Phillips 203, 8am | ||