|
|
|||||
| 1 | Introduction and Java Review | Lab 1: Mind Reader | Reading: Chp 1 Problems: 1.8, 1.15-1.18 |
||
| 2 | Polymorphism | Lab 2: MineSweeper | Reading: Chap 2 Problems p. 43: 2.2, 2.3, 2.6 p. 53-4: 2.10, 2.11, 2.13, 2.15, 2.16 p. 58-9: 2.20, 2.22, 2.24 |
Labor Day: No class Mon Sept 3 | |
| 3 | Interfaces, Abstract classes, Inheritance | Reading: finish Chap 2 | |||
| 4 | Stacks and Queues | Lab 3: Shapes Scene Graph | Reading: Chp 3, begin Chp 4 Problems: Chp 3 - p. 76: 3.3; p. 82: 3.9 |
||
| 5 |
|
Array Based Structures | Lab 4: Stacks and The Postfix Calculator | Reading: finish Chp 4, begin Chp 5 | |
| 6 |
|
Exam1 | Lab 5: Array Based Structures and Yukon Solitaire | Finish Chp 5, begin Chp 6 | |
| 7 |
|
Linked Lists | Lab 6: Linked Lists and Sorting Cards | Finish Chp 6 | Fri: Prof Orr at conference |
| 8 |
|
Complexity Analysis, Sorting | Lab 7: Complexity and Simple Sorts | Chp 7 and begin Chp 8 | Fri: Midsemester day |
| 9 |
|
Induction | Lab 8: Recursion and Divide-and-Conquer Sorting | Finish Chp 8 and begin Chp 9 | |
| 10 |
|
Recursion | Lab 8: Recursion and Divide-and-Conquer Sorting (cont) | Finish Chp 9 | |
| 11 |
|
Trees | Lab 9: Trees | Reading: Chapter 10, Chapter 11, Section 3 | |
| 12 |
|
Trees (cont) & Exam 2 | Lab 9: Trees (cont) | Reading: finish Chapter 11 (Sets and Hash Tables) | |
| 13 |
|
Sets and Hashing | Lab 10: Hash Tables | Thanksgiving: Nov 22-23 | |
| 14 |
|
Heaps and Radix Sort | Lab 11: Heaps | Reading: Section 14.1, pp 369-377 | |
| 15 |
|
Review for final. | |||
| 16 |
|
| |||