EECS  3101 : Lecture Notes

---

• LN1:     html      Introduction:   Towers of Hanoi and Generalization.   
• LN2:     pdf         Machine Model and Timing Analysis Notation. 
  
• LN3:     pdf         Recurrence Relations.   
• LN4:     pdf         Incremental Method:   The Longest Smooth Subarray Problem.  
  
• LN5:     pdf         Lower Bound  for Comparison-Exchange-Based  Sorting.
  
• LN6:     pdf         A Linear Time Selection Algorithm.  
  
• LN7:     pdf         Greedy Method:  Coin Change Making. 
  
• LN8:     html      Greedy Method:  The Optimal Interval Point Cover Problem.   
• LN9:     pdf         Dynamic Programming Method:  Optimal Static Binary Search Trees.
  
• LN10:   pdf         Graphs:  The Strongly Connected Components Algorithm.
  

---