Sum of Subsets Problem using Backtracking || Design and Analysis of Algorithms || DAA

preview_player
Показать описание
#sudhakaratchala #daavideos #daaplaylist
Suppose we are given n distinct positive numbers and we desire to find all combinations of these numbers whose sum is M. This is called a sum of subsets problem.
The element xi of the solution vector is either ‘1’ or ‘0’ depends on whether the weight wi is included or not
For a node at level ‘i’ be the left child corresponding to xi =1 and right corresponds to xi =0
Рекомендации по теме
Комментарии
Автор

Ur helping so many students really
Thank you sir 👍👍

SpeedBus
Автор

How many solutions probably we got?? How long we have to do? Hope you respond to my query sir

LE_MadhukarKota
Автор

Thank you sir!
Sir could you please upload other daa topics like skip lists, avl trees, 2-3 trees, tries, tsp, graph coloring, branch and bound as soon as possible.

caroldanvers
Автор

Sir if the question is lengthy then how many solutions should we find?

Ontherocks
Автор

Sir we should do Right Sub Tree as Must and Should Sir for Exam

SandeepKumar-fovz
Автор

Thank you so much sir....very well explained...if we get this subset problem in examination does we need to explore all the nodes no sir???or 2or 3 solutions are exploring all the nodes may be tym consuming no sir ??

sujathaganesna
Автор

sir how many solutions
should we find sir? is one solution is enough in exam?

hiranmai