Course Syllabus
Module 1: Algorithm Design
Module 2: Recursion
Module 3: Divide & Conquer
Module 4: Greedy Algorithms
Module 5: Dynamic Programming
Module 6: Backtracking
Module 7: Branch & Bound
Module 8: Graph Algorithms
Module 9: Complexity Analysis
Module 10: Case Studies
Module 2: Recursion
Module 3: Divide & Conquer
Module 4: Greedy Algorithms
Module 5: Dynamic Programming
Module 6: Backtracking
Module 7: Branch & Bound
Module 8: Graph Algorithms
Module 9: Complexity Analysis
Module 10: Case Studies