Algorithm Design & Analysis notes ppt ( lectures powerpoint slides ).
Lecture Notes
| Topic | Dates | Notes format |
| Introduction | Sept 26-Oct 1 | PowerPoint orPDF |
| Euclidean Alg., Divide&Conquer | Oct 1-3 | PowerPoint orPDF |
| Recurrences | Oct 3 | PowerPoint orPDF |
| Quicksort and Heapsort | Oct 8 | PowerPoint orPDF |
| Memory Hierarchy Analysis | Oct 10 | PowerPoint orPDF |
| More on Sorting | Oct 15 (revised 10/24) | PowerPoint orPDF |
| Hashing | Oct 17-22 (revised 10/22) | PowerPoint orPDF |
| Dynamic Search Trees | Oct 24 (revised) | PowerPoint orPDF |
| Dynamic Programming | Oct 29-31 (revised) | PowerPoint orPDF |
| Greedy Algorithms | Oct 31 | PowerPoint orPDF |
| Minimum Spanning Trees | Nov 5 - 12 | PowerPoint orPDF |
| Shortest Paths Problems | Nov 15-19 (expanded) | PowerPoint orPDF |
| Max Flow Min Cut | Nov 21 | PowerPoint orPDF |
| FFT's and other goodies | Nov 26 | PowerPoint orPDF |
| Incomplete notes on NP completeness | Dec 3 | PowerPoint orPDF |
Textbook
- Cormen, Leiserson, Rivest and Stein, "Introduction to Algorithms (2ndedition)". Available at the UCSD bookstore, amazon.com, and perhapsat Barnes&Noble.
No comments:
Post a Comment