|
|
CS 136:
|
Please look over the material in the reading assignment before each lecture as I will not lecture on everything in the reading assignments.
| Date | Topic | Reading | |
|---|---|---|---|
| 1 | 2/6 | Introduction and Overview | Chap. 0 |
| 2 | 2/9 | Object-oriented languages & Java | Chap. 1, Appendix B |
| 3 | 2/11 | more Java | Chap. 6 |
| 4 | 2/13 | Assertions and Associations | Chap. 2 |
| 5 | 2/16 | ArrayLists/Vectors I | Chap. 3 |
| 6 | 2/18 | ArrayLists/Vectors II | |
| 2/20 | Winter Carnival | ||
| 7 | 2/23 | Complexity | Chap. 4.1 |
| 8 | 2/25 | Lists | Chap. 8.1-8.4 |
| 9 | 2/27 | More Lists | Chap. 8 except 8.8 |
| 10 | 3/1 | Recursion & Induction | Chap. 4.2 |
| 11 | 3/3 | Recursion & Sorting | Chap. 5 |
| 12 | 3/5 | More Sorting | Chap. 5 |
| 13 | 3/8 | Iterators | Chap. 7 |
| 14 | 3/10 | Linear Structures: Stacks | Chap. 9.1 |
| 3/10 | Hour Exam I in Lab | ||
| 15 | 3/12 | More Stacks | Chap. 9.3 |
| 16 | 3/15 | Queues | Rest of Chap. 9 |
| 17 | 3/17 | GUI programming: Events & Swing | |
| 18 | 3/19 | Concurrency | |
| Spring Break | |||
| 19 | 4/5 | Concurrency & JUnit | |
| 20 | 4/7 | Comparable & Ordered Structures | 5.7, Ch 10 |
| 21 | 4/9 | Trees I: Introduction, Specification and Applications | Ch 11 |
| 22 | 4/12 | Trees II: Applications & Implementation | |
| 23 | 4/14 | Trees III: Visitor Pattern | |
| 24 | 4/16 | Heaps and Priority Queues | Ch 12 |
| 25 | 4/19 | HeapSort | |
| 26 | 4/21 | Trees IV: Binary Search Trees | Ch 13.1-4 |
| 27 | 4/23 | Trees V: More Search trees. | |
| 28 | 4/26 | Graphs I: Specification and Applications | Ch 15 |
| 29 | 4/28 | Graphs II: More Applications and Implementations | |
| Lab | 4/28 | Midterm 2 | |
| 30 | 4/30 | Graphs III: More Applications and Implementations | |
| 31 | 5/3 | Graphs IV: More Implementations | |
| 32 | 5/5 | Maps & Dictionaries | Ch 14 |
| 33 | 5/7 | More dictionaries, Hashing | |
| 34 | 5/10 | Design patterns | |
| 35 | 5/12 | Design patterns | |
| 36 | 5/14 | Review |