Programming Interview: 0/1 Knapsack problem using Branch and Bound Method (Part 1)

This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA.

0/1 knapsack problem using branch and bound technique
0/1 knapsack problem using branch and bound method
0 1 knapsack problem using branch and bound example
knapsack problem using branch and bound ppt
0 1 knapsack problem using branch and bound ppt
knapsack problem branch and bound example
branch and bound ppt
backtracking and branch and bound

To prepare for programming Interview Questions on Binary Trees

To study programming Interview questions on Stack, Queues, Arrays visit

To watch all Programming Interview Questions visit

To learn about Pointers in C visit

To learn C programming from IITian S.Saurabh visit

[mark-pwxf]

A great video! very easy to understand. I have to say you are a lot better in explaining the concept than my lecturer ;) thanks!

[ilhamkhan]

Great job! It was veryyyy helpful!
Thanks a lot for uploading...

[JetSethTravel]

The way you speak makes me fall asleep.

[nidhishetty]

Great Video! Your videos are most helpful in understanding concepts! Thanks a lot! 

[TheOneReesy]

Very good video, This is helping my Algorithms revision. Thanks! 

[saikrupa]

thank you so much .. quite simple .. and very clear

[iangibb]

how do you decide on the value of the benefit please?

[pranaydevarashetty]

Expalian by considering fifo and lcbb approaches

[sjagnani]

I am playing videos at 1.5x. still looks slow!

[ranuchouhan]

its realy gud i lyk it n realy helpfull for

[sukeeesh]

you did not tell how to find upper bound when item not selected ...i really got confused

[abhishekkoranga]

what happened to your accent in between