EECS 3101
Design and Analysis of Algorithms
Lecture Slides
(These are power point files. Their pdf version appears in parentheses)



[Slide   1]    Introduction.   (pdf version) 
[Slide   2]    Machine Model and Time Complexity.    (pdf version) 
[Slide   3]    Summations and Recurrence Relations.     (pdf version) 
[Slide   4]    Iteration and Recursion.      (pdf version) 
[Slide   5]    Sorting and Selection.     (pdf version) 
[Slide   6]    Greedy Algorithms.     (pdf version) 
[Slide   7]    Dynamic Programming.     (pdf version) 
[Slide   8]    Graph Algorithms.     (pdf version) 
[Slide   9]    NP-completeness.     (pdf version)