Topic outline

  • General

  • Week-01 Preparing Background

    • View Go through the activity to the end
  • Week-02 Notation and Complexity Analysis

  • Week-03 Searching and Sorting Algorithm Based on Brute Force Approach

  • Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach

    • View
  • Week-05 Introduction to Greedy Approach

  • Week-06 Introduction to Dynamic Programming

  • Week-07 Mid-Term Examination

  • Week-08 Introduction to Dynamic Programming (Continue)

  • Week-09 Introduction to Graph And Graph Traversal

  • Week-10 Graph Application

  • Week-11 Graph: Single Source Shortest Path Algorithm

  • Week-12 Graph: All Pair Shortest Path Algorithm

  • Week-13 Final Presentation and Lab Final

  • Week-14 Final Examination