Wk | Date | Lec | Topic |
Reading |
Lab (Wendesdays) |
Hws |
---|---|---|---|---|---|---|
1
|
8/31 |
1 |
Introduction/Overview |
Chap 1: 9-14 |
camcelled |
|
9/2 |
2 |
Java review, arrays, keyboard input, exceptions and error checking |
Chap 2: 33-41 |
|||
2 | 9/7 |
3 |
Classes, objects and Object-oriented programming |
Chap 1: 14-21, Chap2 44-52 |
arrays, classes |
|
9/9 |
4 |
Java review |
||||
3 | 9/14 |
5 |
Inheritance, polymorphism |
Inheritance |
||
9/16 |
6 |
Abstract classes, interfaces |
||||
4 | 9/21 |
7 |
Linear and binary searches, Intro to complexity theory |
Chap2: 52-76 |
||
9/23 |
8 |
Bubble sort, selection sort, insertion sort |
Chap 3 |
|||
5 | 9/28 |
9 |
Stacks and queues |
Chap 4: 115-143 |
||
9/30 |
10 |
Streams and files |
||||
6 |
10/5 |
11 |
priority queues, parsing |
Chap 4: 143-176 |
||
10/7 |
12 |
- |
||||
7 |
- |
Fall Break! |
||||
8 | 10/19 |
13 |
Linked lists, intro |
Chap 5: 179-212 |
||
10/21 |
14 |
sorted linked list, doubly linked list, circular linked lists, Iterators |
Chap 5: 212-247 |
|||
9 | 10/26 |
15 |
Review |
|||
10/28 |
- |
midterm |
||||
10 | 11/2 |
16 |
Recursion |
Chap 8 |
||
11/4 |
17 |
Merge sort |
Chap 8 |
|||
11 | 11/9 |
18 |
Binary trees |
Chap 11: 519-555 |
||
11/11 |
19 |
Insertion and deletion, traversing |
Chap 11: 555-577 |
|||
12 |
11/16 |
20 |
Hash tables |
Chap 12: 579-588 |
||
11/18 |
21 |
Hashing functions, hashing efficiency |
Chap 12: 588-612 |
|||
13 |
11/23 |
24 |
Heaps |
Chap 13: 615-645 |
||
- |
Happy Thanksgiving! |
|||||
14 |
11/30 |
25 |
Heap sort |
Chap 13: 649-667 |
||
12/2 |
26 |
Graphs, DFS, BFS |
Chap 14: 669-681 |
|||
15 |
12/7 |
27 |
Topological sort, directed graphs |
Chap 14: 687-715 |
||
12/9 |
28 |
Final Review |
||||