CSE  3101 : Lecture Notes

---

• LN0:   html             Introduction: Towers of Hanoi and Generalization.   
• LN1:   ps   pdf        Machine Model and Timing Analysis Notation.
• LN2:   ps   pdf       Recurrence Relations.
• LN3:   ps   pdf       Lower Bound for Comparison-Based Sorting.
• LN4:   ps   pdf       A Linear Time Selection Algorithm.   
• LN5:   html            Greedy: The optimal interval point cover problem.   
• LN6:   ps   pdf       Dynamic Programming: Optimal Static Binary Search Trees.
• LN7:   ps   pdf       The Strongly Connected Components Algorithm.

---