|
|
|
|
|
MW => Mark Allen Weiss, Data Structures and Algorithm Analysis in C
NP => Nick Parlante, Pointers and Memory.
|
|
|
|
| Date |
Topic |
Reading |
Assignment Due |
|
|
|
|
| April 1 |
Introduction |
MW Chap 1 |
|
| April 3 |
Programming |
NP, Sec 1-4 |
|
| April 5 |
Lists |
MW 3.1,3.2 |
|
|
|
|
|
| April 8 |
Fundamentals |
MW Chap 2 |
|
| April 10 |
Analysis of Algorithms |
MW Chap 2 |
HW 1 due |
| April 12 |
Stacks and Queues |
MW 3.3, 3.4 |
|
|
|
|
|
| April 15 |
Trees (Intro) |
MW 4.1-4.3 |
|
| April 17 |
Trees (AVL) |
MW 4.4 |
HW 2 due |
| April 19 |
Trees (Splay,B-Trees) |
MW 4.5-4.7 |
|
|
|
|
|
| April 22 |
Hashing |
MW 5.1-5.2 |
|
| April 24 |
Hashing |
MW 5.3-5.4 |
HW 3 due |
| April 26 |
Binary Heaps |
MW 6.1-6.4 |
|
|
|
|
|
| April 29 |
Binomial Queues |
MW 6.8 |
|
| May 1 |
Midterm Review |
|
HW 4 due |
| May 3 |
Midterm Exam |
|
exam |
|
|
|
|
| May 6 |
Sorting Intro |
MW 7.1, 7.2 |
|
| May 8 |
ShellSort, HeapSort |
MW 7.4, 7.5 |
|
| May 10 |
MergeSort |
MW 7.6 |
|
|
|
|
|
| May 13 |
QuickSort |
MW 7.7 |
|
| May 15 |
Sorting Summary |
|
HW 5 due |
| May 17 |
Disjoint Sets |
MW 8.1-8.3 |
|
|
|
|
|
| May 20 |
Disjoint Sets |
MW 8.4-8.5 |
|
| May 22 |
Graph - Intro |
MW 9.1 |
HW 6 due |
| May 24 |
Graphs - Shortest Path |
MW 9.2,9.3 |
|
|
|
|
|
| May 27 |
Holiday |
- |
- |
| May 29 |
Graphs - MST |
MW 9.5 |
|
| May 31 |
Graphs - apps |
MW 9.6 |
|
|
|
|
|
| June 3 |
Hard Problems |
MW 9.7 |
|
| June 5 |
NP-complete |
|
HW 7 due |
| June 7 |
Final Review |
|
|
|
|
|
|
| June 10 |
No class |
|
|
| June 12 |
Final Exam |
2:30PM - 4:20PM |
exam |
|
|
|
|
|
CSE Home 
