CSC 330, spring 2013
Tentative Lecture and Activities
Schedule
(Subject to changes)
|
Date |
Topics |
|
Dues |
|
1/14 |
JAVA: Inheritance, Generics |
4.1, 4.2, 4.5-8 |
|
|
1/16 |
JAVA: Polymorphism, interfaces |
4.3, 4.4, 4.9 |
|
|
1/23 |
JAVA: Exceptions, Files |
2.5, 2.6 |
|
|
1/28 |
LINEAR: Arrays, Linked-lists |
Ch 15, 17 |
|
|
1/30 |
LINEAR: Stacks, Queues |
Ch 16 |
|
|
2/4 |
LINEAR: Collections |
6.1-6 |
|
|
2/6 |
ALG: Big O, recursion, binary search |
Ch 5 |
HW2 |
|
2/11 |
ALG: D&C (merge sort, quick sort) |
7.5, 8.5, 8.6 |
|
|
2/13 |
ALG: Dynamic Programming |
7.6 |
|
|
2/18 |
ALG: BackTracking |
7.7 |
|
|
2/20 |
TREE: Concepts, tree node, traversals | Ch 18 |
|
| 2/25 | Exam 1 |
|
|
|
2/27 |
TREE: Binary search trees |
19.1-3 |
|
|
3/4 |
TREE: AVL trees | 19.4 |
|
|
3/6 |
TREE: 2-3-4 trees |
|
|
|
3/18 |
TREE: Red-black trees |
19.5 |
|
|
3/20 |
TREE: aa trees |
19.6 |
|
|
3/25 |
TREE: Heaps, heap sort |
Ch 21 |
|
|
3/27 |
TREE: Huffman trees (Greedy) |
12.1 |
|
|
4/1 |
ASSOC: Sets |
6.7 |
|
|
4/3 |
ASSOC: Maps |
6.8 |
|
|
4/8 |
ASSOC: Hashing |
20.1-3 |
|
|
4/10 |
ASSOC: Hashing |
20.4-7 |
|
|
4/15 |
GRAPH: Concepts and API |
14.1 |
HW4 |
|
4/17 |
GRAPH: Representations, Graph class |
14.1 |
|
|
4/22 |
GRAPH: Traversals |
|
|
|
4/24 |
GRAPH: MST (Greedy) |
|
|
| 4/29 | Exam 2 |