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

#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

[@SpeedBus1725]

Ur helping so many students really
Thank you sir 👍👍

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@Tech_box_12]

Sir where is 8 by 8 queens problem

[@SudhakarAtchala]

n queens problem video is uploaded, go through that video. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@bhargav5611]

Nice explanation sir thank you

[@SudhakarAtchala]

welcome

[@srikameswari6382]

Thank you so much sir

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@Ontherocks1]

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

[@SudhakarAtchala]

Explore at least half of the state space tree , you may get 2 to 3 solutions if the question is lengthy. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@LE_MadhukarKota]

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

[@SudhakarAtchala]

O to anything. Till we get a solution.
Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@modemharikumar9232]

eagerly waiting for this topic

[@SudhakarAtchala]

K Hari

[@tkeerthi4505]

@@SudhakarAtchala more examples on this topic plz

[@SandeepKumar-fo8vz]

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

[@SudhakarAtchala]

K. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@skakramulali6881]

thanks alot sir

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@caroldanvers2102]

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.

[@SudhakarAtchala]

Can you please send your syllabus to my mail [e-mail]
I will try to cover all other topics also. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@sujathaganesna9604]

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 enough..... exploring all the nodes may be tym consuming no sir ??

[@SudhakarAtchala]

Depending on marks write answer

[@muttumruthyunjaya1587]

Than you sir ❤

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@naveen-kd2uh]

@topper krishna

[@SudhakarAtchala]

K. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@abhi7333]

Super

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@atharvashetty5624]

Thank you sir ❤

[@SudhakarAtchala]

Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...