|
|
|
Topics
|
Slides per Page
|
|
Dynamic Programming
|
1 (ps)
(pdf), 2 (ps) (pdf)
|
|
Greedy Algorithms
|
1 (ps) (pdf),
2 (ps) (pdf)
|
|
Amortized Analysis
|
1 (ps) (pdf), 2
(ps) (pdf)
|
|
Parallel Algorithms
|
1 (ps)
(pdf), 2 (ps) (pdf)
|
|
Computational Geometry
|
1 (ps) (pdf), 2
(ps) (pdf)
|
|
NP-Completeness:1
|
1 (ps) (pdf), 2
(ps) (pdf)
|
|
NP-Completeness:2
|
1 (ps) (pdf), 2 (ps) (pdf)
|
|
Approximation Algorithms
|
1 (ps) (pdf),
2 (ps) (pdf)
|
|
Exact Solutions to NP-Complete Problems
|
1 (ps) (pdf),
2 (ps) (pdf)
|
|
Network Flow and Matching
|
1 (ps) (pdf), 2
(ps) (pdf)
|
Reading
- The P versus NP Problem .
- PRIMES is in P
Demos
- A Stable
Marriage Applet
- An Applet of SkipList
- An Applet of Max Flow
- An Applet
of Line Sweeping Algorithm
- An
Applet of Graham's scan (Convex Hull Algorithm)
|
Textbook: Introduction to Algorithms, McGraw Hill
Publishing Company and MIT Press, 2001 (2nd Edition).
|
|
|
by Thomas Cormen,
Charles Leiserson,
Ronald Rivest, and
Cliff Stein
|
|
The MIT Press web site for the textbook is http://mitpress.mit.edu/algorithms,
and it contains a link to the list of known bugs and errata.
EXAMS
- Thursday, October 16, 2008, 3:45-05:00 pm
{Dynamic Programming, Greedy Algorithms, Amortized Analysis, Parallel
Algorithms} info results
- Thursday, December 11, 2008, 7:45-10:00 a.m.{Computational Geometry,
NP-Completeness, Approximation Algorithms, Max-Flow and Maximum
Matching} info
results
FINAL GRADES
Student Presentations
December 2:
Du, Xiaoxi; Manna, Soumyajit; Nor,
Rizal M.; Venkataramana, Shilpa;
Abu-Ata, Muad M., Hoblos,
Jalaa.
December 4: Khasawneh, Samer F., Lee, Victor
E., Liu, Lin, Ruan, Ning,
Zaber, Moinul I.
Survey Paper Due
Date: December 2 (Survey
Topics)
|