Traveling Salesman Problem using Dynamic Programming

Traveling Salesman Problem using Dynamic Programming | DAA

Рет қаралды 528,065

5 жыл бұрын

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/profile/Jayanti...
Instagram: / jayantikhatrilamba

Пікірлер: 290

@cse47ritikpal85 3 жыл бұрын

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 .

@VinodKumar-fn2iq 3 жыл бұрын

My Teacher posted this link in our Google classroom 😂

@anirudhakulkarni9134 3 жыл бұрын

Same for me...I don't know why we are paying them...I am doing my engineering through online material and YT

@harshkamboj8044 3 жыл бұрын

Same here

@chenchuladeepika9782 3 жыл бұрын

Everything.... Google 🧘‍♀️

@waterspray5743 3 жыл бұрын

@@anirudhakulkarni9134 You're paying them to take exams. lol

@shrutisharma3962 3 жыл бұрын

😂😂😂😂😂😂

@joels978 2 жыл бұрын

Awesome and intuitive explanation that beats all the others I found on KZfaq for this topic. Thanks so much!

@sunnyding602 3 жыл бұрын

this is again the easiest-to-understand video I found. Thank you Jenny!

@gidartsproduction5439 4 жыл бұрын

I have been watch tutorials for years and thankfully I found a helpful channel. Keep up with good work.

@xoxo_kylie 3 жыл бұрын

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

@irishjoybvillanueva8417 3 жыл бұрын

i did not skip the ads because u have really taught me.

@Nam_David 3 ай бұрын

Ms. Jenny, your explanation is absolutely clear. Thank you

@justpurs2306 4 жыл бұрын

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

@rohan8758 4 жыл бұрын

your explanation is too good & you deliver your knowledge in simple terms, thank you madam..

@nishitkashyap8748 3 жыл бұрын

Seeing this before my seminar now I feel confident, Thanks a lot Mam ❤

@anonymousfan9703 Жыл бұрын

Aaya hai bhai Dil vala emoji Kya baat ha bhai

@AshutoshKumar-ne5wv 4 жыл бұрын

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 ❤️❤️❤️❤️

@reyvanadryan2513 4 жыл бұрын

Thanks a lot, i do appreciate this!

@RahulKumar-ck1hr 2 жыл бұрын

Got exactly what I was looking for... Thanks

@nirmaltom4424 4 жыл бұрын

👏🏻👏🏻👏🏻 Better than our college faculty....Thank you mam.. Worth subscribing.. Worth video 👍👍🤓❤️

@RathourShubham 5 жыл бұрын

beauty with brain❤️❤️❤️ Edited : U too take care!!!

@mirzaibrahim9240 2 жыл бұрын

Splendid explanation ! Thank you so much for the video.

@arvindg553 4 жыл бұрын

Only vedio only which explain the formula Thank you ma'am ❤️

@prayagpatel5887 4 жыл бұрын

Love you mam. And also love your effort to make topic simple.

@yuvaraj9268 3 жыл бұрын

Explained beautifully, thank you 🙂🙏

@Aditya-dv5wg 3 жыл бұрын

Excellent teacher and teaching style🔥🔥🔥🔥

@AmitKumar-ub3ev 5 жыл бұрын

Loved the way

@alwaysaditi2001 3 жыл бұрын

Very helpful, thank you!

@MSSKEERTHIKAK 3 жыл бұрын

Thank you so much mam!! Such a good explanation!! ❤

@iamrising7176 4 ай бұрын

You are the best, Jenny.

@poojatikhe2046 5 жыл бұрын

Very good explanation thank a lot.

@vobensingh8404 Жыл бұрын

Best class mam where we never disappointed. 👌❣️❣️❣️

@Ghouse0312 9 ай бұрын

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

@jatinkhanna6681 4 жыл бұрын

Excellent work mam god bless you

@obsinankebebe6567 3 жыл бұрын

Really, I appreciate this lecture video incase of its more understandable. 10q jenny's am with you when ever I am in Cs.

@nishantsaxena7500 5 жыл бұрын

Good Work jenny .. hope soon your subscribers or views will be in millions :)

@saieedkaiser8830 2 жыл бұрын

In detail explanation ...hats off to u

@santhoshk2722 10 ай бұрын

Helped me a lot Thank you

@amritpalsingh7262 4 жыл бұрын

Great video👌😍, plz upload a series on Fibonacci heap and binomial heap I'll greatly appreciate it. Thanks 🙏

@shrinathgaikwad8028 Жыл бұрын

Great teaching techniques and skills mam

@patelshubhamkumar6263 4 жыл бұрын

The best teacher ever... Give like if u also like the way ma'am teaches!!

@utkarshkumar5349 2 жыл бұрын

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.

@SAM-mug Жыл бұрын

Wah yr kamal ker diya apne tu... Mujhy samajh aa gya 😃

@user-om6te2bo7k Жыл бұрын

I got very good faculty here, I can understand easy way. Thankyou ma'am

@mamatanayak6739 Жыл бұрын

Many many thank you mam .excellent your explain travelling sales man problem .

@warriorforsure Жыл бұрын

Aaapki awaaj me suru me itni sehmi sehmi se thi...aur last me boom boom...you are sweet so..❤️❤️... thanks

@exploreworld743 4 жыл бұрын

Mind blowing sperrrrr

@manav____ 3 жыл бұрын

I was kind of stressed out but your smile in the begging made my day! and by the way great explaination.

@user-gq1ij 3 жыл бұрын

To unka exam nhi hai, vo to smile krengi hi, hmara exam hai, hm royenge

@SS40519 4 жыл бұрын

Love you 😘😘 and your teaching skills

@isaacade2075 4 ай бұрын

Amazing teacher. Wow

@bhavana.hgowda2743 Ай бұрын

Mam ur teaching is just amazing😊

@dheerajnemalikanti3703 5 жыл бұрын

Great work didi !!

@abhishekmahawadi7670 5 жыл бұрын

Good and easy explanation

@sireeshauppala2084 2 жыл бұрын

very clear explanation mam ,thank you

@user-xr9qo6bi2z 10 күн бұрын

you are the best teacher

@rituvishwkarma1887 3 жыл бұрын

Thank you so much mam for solving this problem

@rudratejjadhav911 3 жыл бұрын

👌👌 great lecture easy to learn

@wasit-shafi 4 жыл бұрын

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

@bhavanipandugah4455 Жыл бұрын

I watched this vedio before my exam and got full marks.... thank you so much madam

@anmolkesharwani8208 4 жыл бұрын

great work ma'am

@sejaaaa3993 3 ай бұрын

Dayumm best video

@adityadev2825 4 жыл бұрын

Awesome 🔥

@falonlisten3269 Жыл бұрын

Thank you Jenny

@fitnesswithvaibhav 4 жыл бұрын

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 ❤️❤️😍😍😘😘😘😘😘

@deepanaaruchamy Жыл бұрын

Thank you Soo much it help me ah lot

@anandsingh2653 2 жыл бұрын

Life saver mam..tqq soooo much

@pdivyapdivya7455 2 жыл бұрын

Really exllent teaching mam

@biswadeepchakraborty5354 5 жыл бұрын

Nicely explained

@nirajmeshram4 5 жыл бұрын

bhot bhot bhot bhot bhot bhot thankyou...............................................

@cri789 Жыл бұрын

Mind blowing explainition

@kartikeyvishwakarma9944 4 жыл бұрын

good explanation!!

@user-hv7li2ko7l 4 жыл бұрын

I love you so much with your perfect vedios.

@user-hv7li2ko7l 4 жыл бұрын

I love you so much

@ganeshjaggineni4097 Жыл бұрын

NICE SUPER EXCELLENT MOTIVATED

@patricechaula3430 Жыл бұрын

Thank you Jenny.

@nikhilgoyal007 2 жыл бұрын

Thank you!

@biswadeepchakraborty5354 5 жыл бұрын

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

@nandanbanerji8309 2 жыл бұрын

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.

@SAM-mug Жыл бұрын

@jenny, Is this C Matric standard or we can use any numbers within this matrix? like how come 16, 11,6 are the numeric values for B,C,D respectively?

@prottaybadhon8112 4 жыл бұрын

thank you very much

@Chhiling08 5 жыл бұрын

thanks a lot maam

@LogicalSharmaSupport 2 жыл бұрын

😀 kal mst hai mera aaj iss video ko dekhne k baad lag raha hai ye sab easy hai

@mygchrome9135 5 жыл бұрын

You rock Jenny Lamba! You made this problem so easy! Amazing explanation by a very attractive lady! Keep it up!

@saitejamerugu3725 4 ай бұрын

Thank you so much mam

@Orthodox19. 3 жыл бұрын

I most Like and Arciate you !!!

@navjeetkaur5742 3 жыл бұрын

Thank u teacher.

@dhanushh2171 Жыл бұрын

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

@YasirAli-sj5ql Жыл бұрын

Thank U.

@AdityaKumar-rt2qf 3 ай бұрын

nice explanation mam

@haadbajwa7565 2 жыл бұрын

Mathematics makes a simple problem so complicated

@sharonlul8181 5 жыл бұрын

Plz do a topic on traveling salesman with branch and bound method

@donLennin 4 жыл бұрын

@Jenny's lectures CS/IT NET&JRF You should do a video on the proof of the complexity for this method.

@deepanaaruchamy Жыл бұрын

Very clear

@amankumaramar271 3 жыл бұрын

thank you Maam

@krishnapriya8729 6 ай бұрын

thankyou 😄

@rammanoharkoruprolu9869 3 жыл бұрын

This method is awesome....compare to coloum and row reduction method .....anyways thanks mam...

@vinoduppara1246 3 жыл бұрын

Tomorrow is my exam Ur saviour to me

@shridharachari7081 3 жыл бұрын

Spr teaching..

@carameshnaragani7395 3 жыл бұрын

u r beauty with brain 😍😍😍😍😍😍

@PRAVH 5 ай бұрын

Thanks Mam

@ranjandas509 4 жыл бұрын

Perfect explanation.......

@Slientlofi 3 ай бұрын

Ammizing ❤

@singhkingsrivastav131 2 жыл бұрын

Great 👍

@ganeshyc 10 күн бұрын

Nice❤❤

@akshitmangotra5370 4 жыл бұрын

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