knapsack problem in hindi Urdu, using dynamic programming, greedy method algorithms in hindi urdu

Thank u helped lot its from 4th sem ise and cse department daa subject

Obj with min weight last obj 4 ana hy na k 3 please review

❤

Very easy explanation thanks a lot .. 🙏❤️

Thanks ma'am ❤ for the explain

It's greedy method

Thanks mam.. kl exam h.. or aj clear hua.. Kafi video dekha but samajh nahi aaya... Thanks so much

Last main max ratio 2bar 3hai aapne ak bar hi kia..

after 18 the highest profit was 15 not 10.

Thank you so much ma'am...very well explained

is this fractional knapsack?

Ma'am thank you so much 🔥🔥🔥🔥🔥🔥🔥🔥👍👍👍👍👍

Thanks a lot yaar 😍😍😍👍

Thank you so much ma'am .. very well explained😊

Optimal solution kya aaya mam?

Remaining weight 15 kesy aya??

Thanks a lot mam

Thank you ma'am

Thanks ma'am it helps me to make my assignment easier🙂

Thnx.

Excellent job......Thanks You so much Mam.