EECS 477: Introduction to Algorithms
Fall 2002
Lecture notes are posted here.
Lectures
- 9/3: intro, sets, functions, proofs
PDF
- 9/5: mathematical induction, limits
PDF
- 9/10: algorithmics, computing math functions
PDF
- 9/12: algorithmics, problems/instances
PDF
- 9/19: asymptotic notation
PDF
- 9/24: asymptotic notation, control structures, recursion
PDF
- 9/26: recursion and recurrencies
PDF
- 10/1: master theorem
PDF
- 10/3: data structures
PDF
- 10/8: data structures: heaps, union-find,
binomial heaps PDF
- 10/10: greedy algorithms PDF
- 10/17: greedy algorithms PDF
- 10/22: overview of relevant topics
- 10/24: MIDTERM in class
- 10/29: MIDTERM solutions discussed
- 10/31: divide and conquer (long integer
multiplication and linear time median) PDF
- 11/5: dynamic programming
PDF
- 11/7: dynamic programming
PDF
- 11/12: graphs and games
PDF
- 11/14: graphs and games, branch and bound
PDF
- 11/19: linear programming and FFT
PDF
- 11/21: starting complexity
PDF
- 11/26: complexity, P and NP
PDF
- 12/03: P and NP, examples
PDF
- 12/05: Approximate algorithms
PDF
- 12/10: final overview
PDF
Copyright © 2002 Igor Guskov