223 Lecture Schedule
Fall 2003
Lecture Grades
| Date | |||
| 8/30 9/1 9/3 |
CS: Chap 7 & 8 CS: Chap 17 |
Introduction & Java Review Java Review Dictionaries |
No labs this week Assignment 1 |
| 9/6 9/8 9/10 |
CS: Chap 19 CS: Chap 19 |
Holiday Hashing Collision Resolution |
In-Lab 1 Out-Lab 1 |
| 9/13 9/15 9/17 |
CS: Chap 19 CS: Chap 24 CS: Chap 24 |
Hashing efficiency & implementation Tree concepts Eclipse tutorial from Clint |
Prelab In-lab 2 Out-Lab 2 |
| 9/20 9/22 9/24 |
CS: Chap 25 CS: Chap 26 CS: Chap 27 |
Tree traversals & recursion BST implementation Heaps |
In-lab 3 Out-Lab 3 |
| 9/27 9/29 10/1 |
CS: Chap 27 |
Heaps Review Exam |
Out-Lab 4 |
| 10/4 10/6 10/8 |
CS: Chap 28 CS: Chap 28 CS: Chap 28 |
Balanced BST AVL Trees Implementing an AVL Tree |
In-lab 4 |
| 10/11 10/13 10/15 |
CS: Chap 28 CS: Chap 28 NN: Chap 1 |
Multiway Search Trees Red-Black Trees Divide & Conquer algorithms |
In-lab 5 Out-Lab 5 |
| 10/18 10/20 10/22 |
NN: Chap 1 NN: Sect 2.6 |
B-Trees & miscellaneous Introduction to algorithms Multiplying large integers |
In-lab 6 |
| 10/25 10/27 10/29 |
NN: Sect 2.4 NN: Sect 3.1 NN: Sect 3.3 & 3.4 |
Matrix multiplication Dynamic Programming Chained matrix multiplication |
In-lab 7 Insert & print of Out-Lab 5 due |
| 11/1 11/3 10/5 |
NN: Sect 3.4 NN: Sect 3.5 NN: Sect 3.5 |
Chained matrix multiplication Optimal Binary Search Trees Optimal BST |
In-lab 8 Delete & search due Out-Lab 6 |
| 11/8 11/10 11/12 |
NN: p.137-140 |
Review Exam 2 Introduction to Greedy Algorithms |
|
| 11/15 11/17 11/19 |
CS: Chap 29 CS: Chap 30 NN: Sect 4.1 |
Graphs Graph inplementation Minimum Spanning Trees |
In-lab 9 Out-Lab 7 |
| 11/22 11/24 11/26 |
NN: Sect 4.2 NN: Sect 4.4 |
Dijkstra's algorithm Huffman code Thanksgiving |
|
| 11/29 12/1 12/3 |
NN: Sect 4.5 NN: Chap 7 NN: Chap 8 |
Huffman code The Knapsack Problem Map labeling |
In-lab 10 |
| 12/6 12/8 12/10 |
|
The Java Collection Framework Review Review |