| WEEK
| Monday
| Tuesday
| Wednesday
| Thursday
| Friday
|
| March 28-April 1 |
Intro, Stacks, Queues;
ink;
FirstDayHandout;
3.1-3.7
|
|
Empty Queue;
ink;
HW01 Slides;
Proofs by Induction;
ink;
Induction Exercise;
1.1-1.6
|
|
Math Review, Analysis;
ink;
CoinFlip.java;
2.1-2.4
|
| April 4-8 |
Asymptotic Analysis;
ink;
Complexity Exercise;
HelpSession1 (queue,induction);
Still Ch 2
|
|
Dictionary ADT's; Binary Trees;
ink;
4.1-4.3
|
HelpSession2 (induction,complexity)
|
Binary Search Trees;
ink;
4.3
|
| April 11-15 |
AVL Trees;
ink;
HelpSession3 (induction,complexity);
4.4
|
|
AVL Trees; Priority Queues;
ink;
HW03 Slides;
4.4; 6.1-6.3
|
HelpSession4 (BST, AVL Trees)
|
Priority Queues & Binary Heaps;
ink
|
| April 18-22 |
Disjoint Sets & Union Find;
ink;
HelpSession5 (BST, AVL Trees, Heaps);
8.1-8.3, 8.7
|
|
Implementing Union Find;
ink;
8.3-8.4
|
|
B+-Trees;
ink;
4.7
|
| April 25-29 |
Hashing;
ink;
HelpSession7 (UnionFind, B+-trees);
5.1-5.2
|
|
Hash Collisions;
ink;
5-3-5-6
|
|
Midterm Review
Review List
|
| May 2-6 |
Midterm Exam
|
|
Finishing Hash Collisions;
HW04 slides
|
|
Intro to Graphs;
ink;
Midclass Eval Summary;
9.1
|
| May 9-13 |
Topological Sort and Traversals;
ink;
HelpSession10 (Hash Collisions, Graphs);
9.2
|
|
Shortest Paths;
ink;
9.3
|
|
HW05 slides;
9.3
|
| May 16-20 |
Spanning Trees;
ink;
related to 9.6
| |
Minimal Spanning Trees;
ink;
9.5 |
|
Sorting I;
ink;
7.2, 7.5, 7.6
|
| May 23-27 |
Sorting II;
ink;
7.7, 7.11-12
|
|
Applications;
ink |
|
Finish Applications |
| May 30-June 3 |
NO CLASS
Memorial Day |
|
Review;
Review List
Practice Final Exam |
|
Review
Practice Final Exam Solutions |