| Lecture | Dates | Readings | Subject matter | Recitations / Exams |
| Week 1:
O-O Intro A list of numbers |
Aug 27, 29, 31 | 1 and 2 |
Rec 1:
Introduction to the Programming Environment |
|
|
Week 2: Generic Code in Java |
Sept 5, 7 (Sept 3: Labor day) |
3 (8 of LL) |
Rec 1:
Introduction to the Programming Environment |
|
|
Week 3: Stacks |
Sept 10, 12, 14 | 4 | Rec 2: A Simple Class | |
|
Week 4: Strings, extending classes |
Sept 17, 19, 21 | 6 (Sec 1, 2), 11, 15 (Sec 1.1) |
Rec 3: An Array of Objects | |
|
Week 5: Queues |
Sept 24, 26, 28 | 6 (Sec 3), 13, 15 (Sec 1.2) |
Rec 4: Developing an I/O Package | |
|
Week 6: Reverse Polish Notation |
Oct 1, 3, 5 | 6 (Sec 4), 15 (Sec 2 - 4) |
Rec 5:
A Stack Application Delimiter Matching Project 1: |
|
| Week 7: Simulation | Oct 8, 10, 12 | Review |
Rec 6:
A Queue Application Studying Network Node Behavior Using Event-Driven Simulation |
|
|
Week 8: Review and simulation |
Oct 15, 17, 19 | 16 |
Rec 6:
A Queue Application Studying Network Node Behavior Using Event-Driven Simulation Exam: Oct 17 (Review, Exam Answers) |
|
|
Week 9: Recursion |
Oct 22, 24, 26 | 7, 8, 17.1.3 | Rec 7: Instrumenting a Stack | |
|
Week 10: Linked lists |
Oct 29, 31, Nov 2 | 12, Case Study | Rec 8: Doubly-Linked List Iterators | |
|
Week 11: Trees |
Nov 5, 7, 9 | 6 (Sec 5-6), 17 |
Rec 9:
Using Recursion to Traverse a Directory Tree Project 2: |
|
|
Week 12: Project 3 and quicksort |
Nov 12, 14, 16 | 18 (Sec 1-3) | Rec 10: Animation of the Quicksort | |
|
Week 13: Huffman Code |
Nov 19, 21 (Nov 22 : Thanksg.) |
Rec 11:
Huffman Encoding and Decoding of a File |
||
|
Week 14: Huffman Code and Hashing |
Nov 26, 28, 30 |
Rec 11:
Huffman Encoding and Decoding of a File Project 3: |
||
| Week 15 | Dec 3, 5
(Dec 6, 7: Study) |
Rec 12:
Applets and Event-Driven Execution |
||
| Dec 12, 8:00am | Final ( review) |
Notes: