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

Рет қаралды 99,385

3 жыл бұрын

#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

Пікірлер: 31

@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 3 жыл бұрын

Thank you so much sir

@SudhakarAtchala 3 жыл бұрын

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

@modemharikumar9232 3 жыл бұрын

eagerly waiting for this topic

@SudhakarAtchala 3 жыл бұрын

K Hari

@tkeerthi4505 3 жыл бұрын

@@SudhakarAtchala more examples on this topic plz

@skakramulali6881 Жыл бұрын

thanks alot sir

@SudhakarAtchala Жыл бұрын

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

@muttumruthyunjaya1587 10 ай бұрын

Than you sir ❤

@SudhakarAtchala 10 ай бұрын

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

@caroldanvers2102 3 жыл бұрын

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 3 жыл бұрын

Can you please send your syllabus to my mail sudhakar.atchala@gmail.com I will try to cover all other topics also. 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..

@sujathaganesna9604 3 жыл бұрын

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 3 жыл бұрын

Depending on marks write answer

@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.

@Ontherocks1 7 ай бұрын

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

@SudhakarAtchala 7 ай бұрын

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..