Section outline

    • Topics of discussion

      1. Introduction to Dynamic Programming (DP)
      2. Discussion on longest Common Subsequence and Edit Distance Problem
      3. Discussion on longest Increasing Subsequence (DP)

      Expected Learning Outcome

      1. Solve the Longest Common Subsequence (LCS) Problem based on DP
      2. Solve the Longest Increasing Subsequence (LIS)
      3. Exercise the Bin-packing, LCS, LIS Algorithm with some additional problems in the Lab.


      Week-08 Plan
      week planTopicsMaterials
       Week-08 Lecture-01                 
      • Video on Lecture 
      • PPT on Lecture

      Longest Common Subsequence (LCS)                         

      Week-08 Lecture-02
      • Video on Lecture 
      • PPT on Lecture

      Longest Increasing Subsequence(LIS)

       Week-08 Lab
      • Video on Lab
      • Manual on Lab

      Bin Packing,  LCS, LIS


    • forum icon
      Discussion on Week-08 Forum

      Discuss on Week-08 content if you have any problem and confusion. 

    • assign icon
      Lab Activity Assignment
      Students must
      Mark as done