|
Week of
|
Monday
|
Wednesday
|
Thursday - Section
|
Friday
|
Reading
|
| March 30
|
Introduction, Course Overview
Homework 0 assigned |
ADTs, Stacks, Queues
Project 1 released
Homework 0 due
|
Intro
|
Eric McCambridge:
Algorithm Analysis
Asymptotic Analysis
Homework 1 assigned
|
Chapters 1, 2, 3
|
| April 6
|
Eric McCambridge:
Recurrence Relations
Asymptotic Analysis |
Eric McCambridge:
Priority Queues
Binary Heaps
Project 1 due
|
|
Binary heaps
D-heaps
Project 2A released
Homework 2 assigned
Homework 1 due
|
Chapters 2, 6
|
| April 13
|
Leftist Heaps
Skew Heaps
|
Binomial queues
|
|
Binary Search Trees
Homework 3 assigned
Homework 2 due
|
Chapter 6
|
| April 20
|
AVL Trees
|
Splay Trees
Project 2A due
Project 2B released
|
|
KD Trees
Homework 3 due
|
Chapter 4
|
| April 27
|
Midterm Review
|
Midterm Exam
|
|
B Trees
Homework 4 assigned
|
Chapter 4
|
|
May 4
|
Hashing
|
Midterm Exam Post-Mortem
Hashing II
Project 2B due
|
Midterms Returned
|
Disjoint Sets
Project 3 released
Homework 5 assigned
Homework 4 due
|
Chapters 4, 5
|
|
May 11
|
Disjoint Sets
Sorting |
Divide & Conquer Sorting
|
|
Other Sorting
Homework 6 assigned
Homework 5 due
|
Chapters 5, 7
|
|
May 18
|
Graph Representations
|
Graph Traversals
|
|
Djikstra's Algorithm
Homework 7 assigned
Homework 6 due
|
Chapters 7, 8, 9
|
|
May 25
|
No Class - Memorial Day
|
A* Algorithm
Floyd-Warshall Algorithm
Project 3 code due
|
|
Network Flow
Homework 8 assigned
Homework 7 due
|
Chapter 9 |
|
Jun 1
|
Spanning trees |
Final Review
Project 3 benchmarking
due
|
Final Review
|
Good News
Bad News
Homework 8 due
|
Chapter 9
|
|
Jun 8 |
Final, Thurs June 11
8:30 a.m. - 10:20 a.m.
EEB 037
|