ya from today onwards i will upload videos on backtracking only. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Yes, somewhat different approach. This is the correct solution. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
sir, why we took d[3] instead of d[6]? i didn't understand how u said vertex 3 came first. at Timestamp- 8.44 do you mean the order of vertices or most recently found 30 value?
Sir I got good marks
Tq so much sir 🤗😊
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir plz explain backtracking applications sir ,Hamiltonian cycles,sum of subsets ,n queen,graph coloring
ya from today onwards i will upload videos on backtracking only. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@@SudhakarAtchala ok sir tq
Really helpful ❤
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir computer networks continue cheyandi sir please
Thanks a lot sir🎉
All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
The path we got is 1-2-3-6-5-7-4 but actually there is no path from 3-6
Yes, somewhat different approach. This is the correct solution. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank you soo much sir
Most welcome. Please like the video, subscribe to the channel, and share it with your friends. Thanks in advance.
sir, why we took d[3] instead of d[6]? i didn't understand how u said vertex 3 came first. at Timestamp- 8.44 do you mean the order of vertices or most recently found 30 value?
Vertex. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Pls solve the knapsack problems using dynamic programming , wight, value, items pls upload
Okay very soon. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
K sir Sure👍
In last step d[7] of 42 is replaced with 20 . Is it correct or wrong sir?
No, it is wrong
Nice explanation sir thank you
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
sir pls can you post all concepts related to daa in one playlist
plz post ur syllabus in comments.Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Big fan anna ❤
Thank you so much. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir how to solve undirected grap??
We can apply on the directed graph. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
thank u sir
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir please explain optimisation operation research subject
Okay. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir meeru ye college or university lo teach chestaru sir
Lbrce . Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@@SudhakarAtchala your students are very lucky sir
Hi sir notes provide cheyochuga
Okay Noted. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@@SudhakarAtchala prim's and krushkals algorithms data structures lo discrete mathematics lo same method ah sir please reply sir
♥️
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
☺️☺️Nice video
Thanks 🤗 Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
@@SudhakarAtchala sure sir really the way u explaining is too good and easily understandable...☺️
Super nice nice explanation Jagadeesh NRI 18KN1A1209
Thanks
🙏🙏🙏🙏🙏
thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.