Week-01 Preparing Background
2
Week-02: Notation and Complexity Analysis
3
Week-03 Searching and Sorting Algorithm Based on Brute Force Approach
4
Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach
5
Week-05 Introduction to Greedy Approach
6
Week-06: Introduction to Dynamic Programming
7
Week-07 Mid-Term Examination
8
Week-08: Introduction to Dynamic Programming (Continue)
9
Week-09: Introduction to Graph And Graph Traversal
10
Week-10: Graph Application
11
Week-11: Graph: Single Source Shortest Path Algorithm
12
Week-12: Graph: All Pair Shortest Path Algorithm
13