|
|
Schedule and topics are subject to changes.
|
|
Material taught in class which is not convered in the slides
will be discribed here
notes
|
| Date
| Slides
| Source
|
| Jan
|
Introduction. Big-O, Omega, Theta, and recursion formula
| CLRS
|
| Jan
| Stable Marriage
| Handouts
|
| Jan
| Skip Lists
| LD
|
| Jan
|
Sorting in linear time
| CLRS
|
| Jan
|
Lower Bound on Sorting
| CLRS
|
| Feb
| Graphs and MST. An Example of the Greedy paradigm
|
| Feb 12
| Creating Hoffman codes. Another Example of the Greedy paradigm
|
| Feb
| Shortest Paths (positive weights)
|
| Feb
| Shortest Paths (negative weights)
|
| Feb
| All Pairs Shortest Paths - Johnson algorithm
| CLRS
|
| Feb
| All Pairs Shortest Paths - Warshll-Floyd algorithm
| CLRS
|
| Materials for the midterm ends here.
|
| Feb
| Dynamic-Programming
| CLRS
|
|
| March
| Network Flow
| CLRS
|
| March
| Computational Geometry
| CLRS
|
| April
| Approximation Algorithms
| CLRS
|
| April
| Additional Materials
|
|
|
|
|
|