Traveling Salesman Problem using Dynamic Programming | DAA
ฝัง
- เผยแพร่เมื่อ 5 ต.ค. 2024
- Discussed Traveling Salesman Problem -- Dynamic Programming--explained using Formula.
TSP solved using the Brute Force method and Dynamic Programming approach
Time Complexity using DP approach would be O(2^n * n^2)
See Complete Playlists:
Placement Series: • Placements Series
Data Structures and Algorithms: https: • Data Structures and Al...
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
![เปิดบ้าน พี่ตูน Bodyslam หลังใหม่คนแรก ที่ภูเก็ต l [Nickynachat]](http://i.ytimg.com/vi/flFwcmyDQSk/mqdefault.jpg)
You are really very good teacher of data structure & algorithms. I learn very soon from your explanations. Thanks a lot ma'am for your without paid teaching, may God bless you .
My Teacher posted this link in our Google classroom 😂
Same for me...I don't know why we are paying them...I am doing my engineering through online material and YT
Same here
Everything.... Google 🧘♀️
@@anirudhakulkarni9134 You're paying them to take exams. lol
😂😂😂😂😂😂
this is again the easiest-to-understand video I found. Thank you Jenny!
Awesome and intuitive explanation that beats all the others I found on TH-cam for this topic. Thanks so much!
After watching your tutorials a lot....I got something very clear... You explain things more beautifully than Abdul Bari... He teaches well also... your tutorials look similar to him... but you are good at explaining... and thanks ... Lots of Love from...Balochistan
Seeing this before my seminar now I feel confident, Thanks a lot Mam ❤
Aaya hai bhai
Dil vala emoji
Kya baat ha bhai
your explanation is too good & you deliver your knowledge in simple terms, thank you madam..
If only my teacher explained to me this clearly in class i would be somewhere now.... Thanks madam for breaking down a complex problem so intuitively
Ms. Jenny, your explanation is absolutely clear. Thank you
Your teaching skill osam
keep it up......
I am an 3rd year engineering student so this day's you help me lot of
So I just say love you ❤️❤️❤️❤️
i did not skip the ads because u have really taught me.
beauty with brain❤️❤️❤️
Edited : U too take care!!!
I have been watch tutorials for years and thankfully I found a helpful channel. Keep up with good work.
you are the best teacher
👏🏻👏🏻👏🏻 Better than our college faculty....Thank you mam.. Worth subscribing.. Worth video 👍👍🤓❤️
Only vedio only which explain the formula
Thank you ma'am ❤️
I was kind of stressed out but your smile in the begging made my day! and by the way great explaination.
To unka exam nhi hai, vo to smile krengi hi, hmara exam hai, hm royenge
Great teaching techniques and skills mam
Sometimes when people first hear about the Traveling Salesman problem, they think: "Oh, that's not hard. Start with a city on the map; move to the nearest unvisited city; and then on each subsequent step, move to the nearest still-unvisited city, until you're done." This strategy is called a "greedy strategy": it always goes to the nearest allowed step.
Now consider four cities, all placed along the number line. City A is at point 0, City B at point 2, City C at point 3, and City D at point 10:
A B C D
00-01-02-03-04-05-06-07-08-09-10
Now, start a traveling salesman tour at City B, and use the greedy algorithm to choose your tour of the four cities, beginning and ending at B. How long is the greedy algorithm’s tour?
Can you answer me, mam
Thank you so much Ma'am
All concept clear
I watched your 0/1 knapsack problem using Dynamic programming
It's very helpful
Thank you ma'am ❤❤
I shared this with my friends too 😊😊
osom...! i am CS from past 5 year & i think ur way of teaching just osom...how simply u explain in ur videos i to like ur quick sort vidoe too much...keep it up...
Got exactly what I was looking for... Thanks
Plz do a topic on traveling salesman with branch and bound method
Mam this video also has relative content loudness of -3.5db. Many of us are watching you on mobiles and laptops without earphones. Please give some efforts on good video editing and processing too. Thanks.
I watched this vedio before my exam and got full marks.... thank you so much madam
Helped me a lot Thank you
Aaapki awaaj me suru me itni sehmi sehmi se thi...aur last me boom boom...you are sweet so..❤️❤️... thanks
The best teacher ever...
Give like if u also like the way ma'am teaches!!
Good and easy explanation
Explained beautifully, thank you 🙂🙏
Thank you Jenny
I got very good faculty here, I can understand easy way. Thankyou ma'am
i want to give u one suggestion please give link of code also so that students can also visit it understand how to write program for given algorithm.. which will really helpful ...
love it mam your way of explaining is very simple and convenient to us. I have also learned data structures lectures from your videos that was also very compatible for me. it's my pleasure to learn from you Jenny mam....😊😊😊
Mam ur teaching is just amazing😊
Love you mam. And also love your effort to make topic simple.
Best class mam where we never disappointed. 👌❣️❣️❣️
Where is the dynamic programming part of this solution? Did you store any previous calculated value?
There is no such case for storing and reusing bro, it is just a recursive approach
@@ddjampani5480 this video title is "dynamic programming"
Mathematics makes a simple problem so complicated
Tomorrow is my exam Ur saviour to me
Wah yr kamal ker diya apne tu... Mujhy samajh aa gya 😃
Excellent work mam god bless you
Great video👌😍, plz upload a series on Fibonacci heap and binomial heap
I'll greatly appreciate it.
Thanks 🙏
Very good explanation thank a lot.
😀 kal mst hai mera aaj iss video ko dekhne k baad lag raha hai ye sab easy hai
Really exllent teaching mam
Please upload all concepts on DAA and computer networking
mam could you please suggest me from where you have read and understood the concepts. You are damn well explaining and i want to learn this subject more deeply.So suggest me a website or books or the best place u know so that it increases my conceptual and coding skills in DSA
Many many thank you mam .excellent your explain travelling sales man problem .
Thanks a lot, i do appreciate this!
Thanks mam you are the best teacher in the world please ap hamay thoday or questions kraya kro taki hamari gate ki preparation ho Jaye ❤️❤️😍😍😘😘😘😘😘
Good Work jenny .. hope soon your subscribers or views will be in millions :)
Loved the way
Thanks for the nice video madam . I had been struggling with graph theory for a long time . But you explained as easily as teachers used to explain in middle school.
You are the best, Jenny.
Mam .. in previous coin problem video for finding maximum number of ways , .... You told there is 1 way to get the amount 0 ..
But in this video , you are telling there are 0 ways to get the amount 0 .. Can u explain me this clearly mam
Hello ma'am according to the tree you represented there are few methods like g(C, D) has been used twice to calculate the result in each recursive call. So can we just hold the first result and apply this during its second call to decrease time complexity or we are recalculating the methods over and over. And what approach is this whether top to down or bottom up approach
Yes, exactly you should do it, as it saves computational cost with respect to recursive calls. That is the primary difference with Recursive approach and DP.
How time complexity is order of n to the power n
excellent mam......................................
Thanks😊
@@JennyslecturesCSIT your welcome
Mam, how is this a DP problem , i mean that was just a Recursion thing in which you took Decision Tree to give a understanding of the problem , you didn't used any Top or Bottom approach ??
DP should be removed from the video title.
Yes, same doubt 🧐
Really, I appreciate this lecture video incase of its more understandable. 10q jenny's am with you when ever I am in Cs.
Excellent teacher and teaching style🔥🔥🔥🔥
In detail explanation ...hats off to u
Amazing teacher. Wow
Isn't this essentially Brute-Force only? You essentially analyzed all possible paths.
Mam, Please make a video on the branch and bound
Can we choose any one method or two methods ?
You rock Jenny Lamba! You made this problem so easy! Amazing explanation by a very attractive lady! Keep it up!
Ma'am please make a video on N-Queen problem. You helps us a lot ma'am.
very clear explanation mam ,thank you
Thank you so much mam for solving this problem
Love you 😘😘 and your teaching skills
Great work didi !!
That problem is in dynamic.. What we do when problem is in branch and bound
March 1 and blue dress at Diwali and sunrise can't wait 🤔🤔
Abdul bari ke pas jao 😂
@@jawadkazim6610 gaya thaa unkaynpaas bechara nahi dekha 😂😂
Mind blowing explainition
I love you so much with your perfect vedios.
I love you so much
Mind blowing sperrrrr
Mam aapse pyar ho gya h😍😍
In our clg the lectures have this much beautiful even our boys didn't miss one class also 😂
Nicely explained
Plz make videos on service to product based company switch.....&video on Graph theory,Bit manipulation
bhot bhot bhot bhot bhot bhot thankyou...............................................
Could this be solved via Dijkstra algorithm ? Because it resembles like that..
Dijkstra algorithm.... ♥️
Had to learn it in my MATLAB in my masters to solve a transportation problem using Dijkstra algorithm....
What beautiful memories! ☺️
Mam app kitne cute ho🤧 sab samaj agaya vaise thx🤧
Mam one doubts in all lecture.
Mai note banata hu serial by serial isiliye "topic ke saath defination" ko vi boad pe likhiye mam please
Revision me problem ho jata hai.
Thank you Jenny.
great work ma'am
@Jenny's lectures CS/IT NET&JRF You should do a video on the proof of the complexity for this method.
Life saver mam..tqq soooo much
NICE SUPER EXCELLENT MOTIVATED
Mam plz explain multistage graph in dynamic programming
Thank you so much mam
Please Make video on computer networks.
Thank you Soo much it help me ah lot
How was the matrix calculated? Why is A to B 16 and reverse just 8? This is not clear.
Will you explain this problem with different example, ie more than 6 nodes, I am fed-up with this common example
👌👌 great lecture easy to learn
Are mam, the graph is showing two values for each pair, for eg. A-B has weight 8 and 16, this is making it confusing !
Thank you so much mam!! Such a good explanation!! ❤
Thanks Mam