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/4 |
Introduction and Overview |
B0, CJ 1, 3 |
| 2 |
2/7 |
Object-oriented programming and
Java |
B1, CJ 4 |
| 3 |
2/9 |
more Java |
|
| 4 |
2/11 |
more Java |
|
| 5 |
2/14 |
Assertions; Vectors I |
B2, B3 |
| 6 |
2/16 |
Vectors II |
| |
2/18 |
Winter Carnival |
| 7 |
2/21 |
Complexity I |
B4.1 |
| 8 |
2/23 |
Complexity II; Lists |
B6 |
| 9 |
2/25 |
Lists |
| 10 |
2/28 |
Extending Classes (inheritance); back to Lists |
| 11 |
3/1 |
Lists |
| 12 |
3/3 |
Recursion and Induction |
B4.2 |
| 13 |
3/6 |
Recursion and Sorting; Insertion Sort
|
B5 |
| 14 |
3/8 |
Merge Sort; Quick Sort |
|
|
3/8 |
Midterm Exam I, 7-9 pm, Clark 105 |
|
| 15 |
3/10 |
Stacks |
B7.1 |
| 16 |
3/13 |
Stack Applications |
B7.3 |
| 17 |
3/15 |
GUI Programming |
CJ 8 |
| 18 |
3/17 |
Finishing Stack Applications |
|
| |
|
Spring Break |
|
| 19 |
4/3 |
Queues |
B7.2 |
| 20 |
4/5 |
Iterators; Ordered Structures |
B8, 9 |
| 21 |
4/7 |
Trees I: Introduction, Specification, and Applications |
B10 |
| 22 |
4/10 |
Trees II: Implementation |
|
| 23 |
4/12 |
Trees III: Traversals |
|
| 24 |
4/14 |
File I/O; Array representation of trees |
|
| 25 |
4/17 |
Heaps and Priority Queues |
B11 |
| 26 |
4/19 |
Heapsort |
|
| 27 |
4/21 |
Trees IV: Binary Search Trees |
B12.1-12.3 |
| 28 |
4/24 |
Trees V: Binary Search Trees (cont'd) |
B12.4-12.6 |
| 29 |
4/26 |
Graphs I: Specification and Implementations |
B14 |
| |
4/26 |
Midterm Exam II, 7-9 pm, Clark 105 |
|
| 30 |
4/28 |
Graphs II: Implementations |
|
| 31 |
5/1 |
Graphs III: Traversals; Dijkstra's
Algorithm |
|
| 32 |
5/3 |
Graphs: Traversals |
|
| 33 |
5/5 |
Dictionaries and Hashing |
B13 |
| 34 |
5/8 |
Hashing (cont'd) |
|
| 35 |
5/10 |
Threads |
|
| 36 |
5/12 |
Applets |
|
