0/1 knapsack problem | example| dynamic programming

0/1 knapsack problem using dynamic programming example

[harshlimbadiya]

In the first step you are forgot to check this condition ( j < weight(i) )condition is true then,
Eqution are: T(i-1, j).
I request to check it.

[pawanthanay]

thank you !!
10:37 one small mistake..

[KRIVASTYLES]

12:00 mam that is maximux value earned not weight

[shubhamalchetti]

As there are 4 weights given then why to go from 0 to 5 and why not from 0 to 4 while preparing the table

[rupalisharma]

u r not taking first maximum value like in ascending order?

[rajaammarzia]

Kindly use another pager ... if u have. Dont turn again and again

[akhilsaiii]

Inta daridram ayna question inta varuku chudala
But thanks for the information

[safmurali.mannam]

Mam T(1, 1), 4) is there T(1, 1)=0 but max(0, 4) is 4 but you write im matrix 0 why mam pls solve my dout

[bhilvijayvijay]

Why 3 value is not considered in step 1

[hinaparmar]

Mam u have done incorrect please first correct it and then upload 🥴

[srivardhansuryavanshi]

Ma'am please pull the camera little upwards so that we could see the full page....!!!

[shreeshkant]

T(1, 1) also gives maximum value 3 then why are you writing zero 0 at that place?

[aartimashram]

Thank u ma'am i understood esily❤🙏

[nalingupta]

if we just need the last column why did we calculate all 5?

[harish.i]

in step 2, 2 you took j as 1 mam pls check it

[kasthoorisrinivasreddy]

Mam if weight is 20 then how to take columna

[srinivasaraokagitha]

If profiles=(60, 100, 120), weight=(10, 20, 30)&m=50.
Then what are optimal solution

[eswarroy]

mam, is there any shortcut for large values

[ArunKumar-yqrs]

Doesn't explained when w[i] will be used🤷

[MrMikomi]

Why write on the reverse side of the paper? What a silly thing to do!