|
Week of
|
Monday
|
Wednesday
|
Thursday - Section
|
Friday
|
Reading
|
|
March 31
|
Introduction, stacks and queues |
Asymptotic analysis
Project 1 released
|
Intro
|
Asymptotic analysis
Homework 1 assigned
|
Chapters 1, 2, 3
|
|
April 7
|
Asymptotic analysis
Priority queues
Binary heaps |
Binary heaps
Project 1 due
|
Java Generics and JUnit |
Binary heaps
D-heaps
Project 2A released
Homework 2 assigned
Homework 1 due
|
Chapters 2, 6
|
|
April 14
|
D-heaps
Leftist heaps
|
Leftist heaps
Skew heaps
Binomial queues |
|
Binomial queues
Homework 3 assigned
Homework 2 due
|
Chapter 6
|
|
April 21
|
Binary Search Trees
|
AVL trees
Project 2A due
Project 2A released
|
|
AVL trees
Homework 3 due
|
Chapter 4
|
|
April 28
|
AVL trees
Splay trees
|
Splay trees
B+ trees
|
Midterm Review
|
Midterm
Homework 4 assigned
|
Chapter 4
|
|
May 5
|
B+ trees
Other search trees |
Hashing
Project 2B due
|
Midterms Returned
|
Hashing
Project 3 released
Homework 5 assigned
Homework 4 due
|
Chapters 4, 5
|
|
May 12
|
Hashing
Sorting
|
Sorting
|
|
Sorting
Homework 6 assigned
Homework 5 due
|
Chapters 5, 7
|
|
May 19
|
Sorting |
Disjoint sets - union/find |
|
Disjoint sets - union/find
Graphs/topological sort
Homework 7 assigned
Homework 6 due
|
Chapters 7, 8, 9
|
|
May 26
|
Memorial Day - No class
|
Graphs/topological sort
Project 3 code due
|
|
Shortest path algorithms
Homework 8 assigned
Homework 7 due
|
Chapter 9 |
|
June 2
|
Minimum spanning trees |
Minimum spanning trees
NP-completeness
Project 3 benchmarking
due
|
Final Review
|
NP-completeness
Homework 8 due
|
Chapter 9
|
|
June 9 |
|
|
Final
10:30 a.m. - 12:20 p.m.
EEB 045 |
|
|
CSE Home 
