0/1 Knapsack Problem using Backtracking Approach || Explained with example || Nepali

[@rustamniraula6536]

The 0/1 knapsack problem is a bounded knapsack problem. In the 0/1 knapsack problem, you can either take an item or not take it, but you cannot take it more than once. The constraint is that each item can only be included in the knapsack once, and the decision must be binary, either 0 or 1. The approach you took is for an unbounded knapsack problem where you can include the same item multiple times.

[@computermerochannel7587]

Well, thanks for your valuable comment. Knapsack problem is a complete NP problem. It is not necessary for 0/1 knapsack problem to be bounded. There is no any hard and fast theory to consider 0/1 knapsack as bounded one unless it is mentioned. For an undergrad level, we don't go with bounded or unbounded concept. Afterall the approach I did also statisfies 0/1 concept at the end where the final solution is obtained in 0 and 1 form where 0 means don't select and 1 means select.

[@ऋतिकाथापा]

kasto clearly bhujaunu bhako xa. keep growing and thank you

[@computermerochannel7587]

Thank you keep supporting. Goodluck for exam.

[@darshanbajgain]

wow yeha ta DAA ko BSc.CSIT ko syallbus ko lagvag sabai algorithm raicha. Dhilo aayo kada aayo. Huge potential cha yo channel ko sir.

[@computermerochannel7587]

Please support through your subscription.

[@suneelpandey5936]

there were actually 5 possibilities of having the max profit with max weight 8. though it was 8,12. ani sikauna chai sajilo gari nai sikaunu bhako ma thank you.

[@computermerochannel7587]

Yeah , it is seen in diagram and missed while saying. Thank you for noticing. Keep supporting. Please consider some minor human errors. Our target is give you concept in easier ways.

[@suneelpandey5936]

Hindi Playlist herda bhnda nepali Playlist le dherai help gareko chha aile. Concept bujhna ko laagi. Thank you so much for that. ❤️

[@nasusanooo]

Aja DAA ko exam ma ako question ko answer 20 hunxa tesovaye? Ki 18?

[@webber5629]

just 0/1 knapsack tw xuttai hola ni Dynamic programming unit ma xa ni ?? yo tw Backtracking unit ko haina 0/1 knapsack using backtracking

[@computermerochannel7587]

Yeah we have uploaded all three types of knapsack problems. Please check the playlist.

[@pranayaghimire1122]

Daa ko exam nikaparsi xa sake samma aru ni halnu haiii video

[@computermerochannel7587]

Yes trying our best.

[@dr.ayurbedic]

sir channel grow hune capacity xa tara .....audio chai improve garna paryo sir

[@computermerochannel7587]

Noted.