Week-01 Preparing Background
6
Week-02: Notation and Complexity Analysis
7
Week-03 Searching and Sorting Algorithm Based on Brute Force Approach
8
Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach
10
Week-05 Introduction to Greedy Approach
11
Week-06: Introduction to Dynamic Programming
12
Week-07 Mid-Term Examination
13
Week-08: Introduction to Dynamic Programming (Continue)
14
Week-09: Introduction to Graph And Graph Traversal
15
Week-10: Graph Application
16
Week-11: Graph: Single Source Shortest Path Algorithm
17
Week-12: Graph: All Pair Shortest Path Algorithm
18
Week-13: Final Presentation and Lab Final
19
Week-14: Final Examination
20