Section outline


    • Topics of discussion

      1. Introduction to Greedy Approach
      2. Discussion on Coin Change Problem
      3. Discussion on Bin packing Problem
      4. Discussion on Knapsack Problem
      5. Discussion on Hoffman coding
      6. Assignment-01

      Expected Learning Outcome

      1. Solve the Coin Change Problem based on Greedy Method
      2. Solve the Knapsack Problem based on Greedy Method
      3. Solve the Hoffman coding based on Greedy Method
      4.  Solve the  Bin packing Problem based on Greedy Method
      5.  Exercise the Sorting Algorithm with some additional problems in the Lab.

    • Week-05 Plan

      Week plan

      Topics

      Materials  

      Week-05: Lecture-09

       Greedy Method:  

      • Coin Change        
      • Bin-Packing Problem

       

       

      Week-05: Lecture-10


      Date: 

      • Greedy Partial Knapsack
      • Greedy Huffman Coding

        


       
       

      Week-05: Lab - 05



      ** Section: O2

      Implementation of

      • Merge Sort

      • Quick Sort

      *** Section: O-2

    • Students must
      Mark as done



      Lab - 05