Course Material

Topic # 1
- Course Introduction | Slides |
- Asymptotic Analysis of Algorithms | Slides | External Ref | Exercises |

Topic # 2
- Divide and Conquer : Introduction and Merge Sort | Slides | External Ref |
- Solving Recurrences | Exercises |
- Divide and Conquer : Quick Sort and Medians  | Slides | External Ref 1 |
- Divide and Conquer : Exercises on Merge Sort and Quick Sort

Topic # 3
- Dynamic Programming : Introduction | External Ref |
- Dynamic Programming : 0-1 Knapsack | External Ref | Exercises |
- Dynamic Programming : Collecting Apples | Notes |
- Dynamic Programming : Longest Common Subsequence | External Ref | Exercises |

Topic # 4
- Greedy Algorithms : Introduction + Activity Selection | Notes | Slides |
- Greedy Algorithms : Fractional Knapsack | Video Lecture |
- Greedy Algorithms : Interval Partitioning  | Slides * |
- Greedy Algorithms: Exercises

* By Kleinberg and Tardos.

Topic # 5
- Backtracking : 0-1 Knapsack  | Exercises
- Backtracking : N-Queens | Notes |

Topic # 6
- Graphs : Introduction, Applications and Representation  | External Ref |
- Graphs : Breadth-First Traversal (BFT) | Slides | Notes | Exercises |
- Graphs : Depth-First Traversal (DFT) | Visualization | Exercises |
- Graphs : Topological Sort | External Ref 1 | External Ref 2 | Visualization |

Topic # 7
- Graphs : Minimal Spanning Trees (Prim's and Kruskal's Algorithms) | Notes | Exercises |

Topic # 8
- Graphs : Single Source Shortest Paths (Dijkstra)
- Graphs : Single Source Shortest Paths (Bellman-Ford)