Computer Algorithms Design and Analysis
- Sep.11 Tutorial 1 - Recurrence: Divide and Conquer Strategy and Analysis (Slide)
- Sep.25 Tutorial 2 - Sorting Algorithms: Probabilistic Analysis (Slide)
- Oct.9 Tutorial 3 - Selection: Adversary Arguments (Slide, Appendix-3.1 )
- Oct.23 Tutorial 4 - Dynamic Set: Amortized Analysis (Slide)
- Nov.6 Mid-term test
- Nov.20 Answers to the test and exercises
- Dec.4 Tutorial 5 - Graph Algorithms (Slide)
- Dec.18
Tutorial 6-7 Dynamic Programming and Greedy (Slide)
Tutorial 8 NP-complete Problems (Slide)
- Sample test
Homework Required
- 1 CH1-CH3
- 2 CH4
- 3 CH5
- 4 CH6
- 5 CH7
- 6 CH8-CH9
- 7 CH10-CH11
- 8 CH13