0/1 Knapsack Problem using Dynamic Programming || GATECSE || DAA

Поделиться
HTML-код
  • Опубликовано: 8 сен 2024
  • 01 knapsack problem || 0/1 knapsack problem using dynamic programming in hindi || 0/1 knapsack problem using dynamic programming || knapsack problem dynamic programming || knapsack problem in daa in hindi || 0/1 knapsack using dp
    This video teaches how to solve the 0/1 Knapsack Problem using dynamic programming. The problem involves packing items with weights and values into a limited capacity knapsack. The goal is to maximize the total value while satisfying capacity constraints. The solution is to break the problem into smaller subproblems and solve them recursively, storing solutions in a tabular format.
    What You Will Learn:
    Dynamic Programming: An algorithmic technique to solve complex problems by breaking them down into smaller subproblems and solving them recursively.
    Tabulation: Storing the solutions to subproblems in a tabular format to avoid solving the problem from scratch each time.
    Memoization: A technique used in dynamic programming to store the solutions to subproblems in memory for faster computation. 💪 Tips and Tricks:
    Break down the problem into smaller subproblems.
    Use a recursive approach to solve the subproblems.
    Store the solutions to subproblems in a tabular format.
    Use memoization to avoid unnecessary computations.
    Contact Details (You can follow me at)
    Instagram: / thegatehub
    LinkedIn: / thegatehub
    Twitter: / thegatehub
    ...................................................................................................................
    Email: thegatehub2020@gmail.com
    Website: thegatehub.com/
    ...................................................................................................................
    📚 Subject Wise Playlist 📚
    ▶️Data Structures: tinyurl.com/bwp...
    ▶️Theory of Computation: tinyurl.com/5bh...
    ▶️Compiler Design: tinyurl.com/2p9...
    ▶️Design and Analysis of Algorithms: tinyurl.com/ywk...
    ▶️Graph Theory: tinyurl.com/3e8...
    ▶️Discrete Mathematics: tinyurl.com/y82...
    ▶️C Programming:tinyurl.com/255...

Комментарии • 41

  • @divypareek8230
    @divypareek8230 4 месяца назад +7

    This lecture of dynamic programming, if watched carefully understanding at each step,is equivalent to 2-2.5 hour lecture of Dp.
    Thank you sir for this amazing session, as my interest grew, I was just sticked to the screen

  • @nikitakhale9172
    @nikitakhale9172 Год назад +5

    Wanted to learn how to find optimal solution. Best explained in this video 🙌🏻thankyou so much

  • @aktarkar9994
    @aktarkar9994 7 месяцев назад +2

    your explanation is nice, I think at first if you describe a scenario and then go for conditions it will be very understandable for everyone.

  • @rkfitnessfan1462
    @rkfitnessfan1462 4 месяца назад +2

    VERY EASY understanding explenation
    sir

  • @faithfulfilms786
    @faithfulfilms786 5 дней назад

    Thank you shoeb bhaiya!

  • @user-qo6vg5jb6y
    @user-qo6vg5jb6y Год назад +5

    very underrated sir

  • @VASANTH_10
    @VASANTH_10 Год назад +5

    Sir very good explanation

  • @shrikantahire2003
    @shrikantahire2003 9 месяцев назад +1

    Brilliant explanation,
    top of everyone

  • @eshamohan8896
    @eshamohan8896 Год назад +4

    Great explanation!

  • @firozahamad9467
    @firozahamad9467 6 месяцев назад +1

    Amazing sir ♥️

  • @garvsharma1210
    @garvsharma1210 9 месяцев назад +1

    How great this teacher is , he never asks to suscribe his channel

  • @nishukumari2014
    @nishukumari2014 9 месяцев назад +1

    Nice explanation ❤

  • @samiransaha5739
    @samiransaha5739 Год назад +2

    best teaherrrrrrrrrrrrrr

  • @omkarbhattarai
    @omkarbhattarai Год назад +1

    nice onee sir ji!!!!

  • @tiffin2358
    @tiffin2358 9 месяцев назад

    Vey nice explanation

  • @yushmmgamer6867
    @yushmmgamer6867 4 месяца назад

    Good content

  • @divyanshsharma673
    @divyanshsharma673 7 месяцев назад +2

    The playlist is fine, I really learnt lot from you but this video is not understandable at all. I watched 2 times but still...

  • @umeshhembrom6699
    @umeshhembrom6699 4 месяца назад

    Nice sir❤❤

  • @AbhishekKumar-wx3rw
    @AbhishekKumar-wx3rw Год назад

    very nice sir myself thankful🍆

  • @VASANTH_10
    @VASANTH_10 Год назад +3

    Became ur fan 🫡

  • @ayushkadyan7261
    @ayushkadyan7261 Год назад

    really great

  • @tanmaykyuvraj
    @tanmaykyuvraj 5 месяцев назад +1

    Thank you sir🙏

  • @codemeanslove
    @codemeanslove 2 месяца назад

  • @Raj-ks1wb
    @Raj-ks1wb Год назад

    Gr8

  • @praveshyadav8756
    @praveshyadav8756 9 месяцев назад

    Why everyone take weight in increasing order

  • @funnewsshorts1171
    @funnewsshorts1171 4 месяца назад

    ❤❤❤❤❤

  • @cyberowl5604
    @cyberowl5604 Год назад +1

    grttt

  • @killer3183
    @killer3183 Год назад

    Sir apne n=2 sirf 2 object place kiya
    Lekin n=3 mei apne 4 object place kiya hai??????
    #The Gatehub

    • @tarunsingh457
      @tarunsingh457 8 месяцев назад

      Because capacity matters too

  • @good114
    @good114 2 года назад

    ❤️❤️💕💕

  • @kartik-yl2gu
    @kartik-yl2gu 10 месяцев назад +22

    not worthy to watch

  • @vedangparashar8074
    @vedangparashar8074 8 месяцев назад

    HAR HAR MAHADEV

  • @sohag5501
    @sohag5501 Год назад +6

    your explanation is nice, I think at first if you describe a scenario and then go for conditions it will be very understandable for everyone.