Traveling Salesman Problem using Dynamic Programming | DAA

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

[@cse47ritikpal85]

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]

My Teacher posted this link in our Google classroom 😂

[@anirudhakulkarni9134]

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

[@harshkamboj8044]

Same here

[@chenchuladeepika9782]

Everything.... Google 🧘‍♀️

[@waterspray5743]

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

[@shrutisharma3962]

😂😂😂😂😂😂

[@joels978]

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

[@sunnyding602]

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

[@irishjoybvillanueva8417]

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

[@justpurs2306]

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

[@xoxo_kylie]

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

[@Nam_David]

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

[@gidartsproduction5439]

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

[@arvindg553]

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

[@rohan8758]

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

[@nishitkashyap8748]

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

[@anonymousfan9703]

Aaya hai bhai
Dil vala emoji
Kya baat ha bhai

[@nirmaltom4424]

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

[@Aditya-dv5wg]

Excellent teacher and teaching style🔥🔥🔥🔥

[@AshutoshKumar-ne5wv]

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

[@RathourShubham]

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

[@mirzaibrahim9240]

Splendid explanation !
Thank you so much for the video.

[@yuvaraj9268]

Explained beautifully, thank you 🙂🙏

[@RahulKumar-ck1hr]

Got exactly what I was looking for... Thanks

[@prayagpatel5887]

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

[@jatinkhanna6681]

Excellent work mam god bless you

[@reyvanadryan2513]

Thanks a lot, i do appreciate this!

[@vobensingh8404]

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

[@shrinathgaikwad8028]

Great teaching techniques and skills mam

[@iamrising7176]

You are the best, Jenny.

[@saieedkaiser8830]

In detail explanation ...hats off to u

[@MSSKEERTHIKAK]

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

[@poojatikhe2046]

Very good explanation thank a lot.

[@Ghouse0312]

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

[@user-om6te2bo7k]

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

[@SS40519]

Love you 😘😘 and your teaching skills

[@AmitKumar-ub3ev]

Loved the way

[@isaacade2075]

Amazing teacher. Wow

[@sireeshauppala2084]

very clear explanation mam ,thank you

[@obsinankebebe6567]

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

[@bhavana.hgowda2743]

Mam ur teaching is just amazing😊

[@santhoshk2722]

Helped me a lot Thank you

[@alwaysaditi2001]

Very helpful, thank you!

[@bhavanipandugah4455]

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

[@warriorforsure]

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

[@amritpalsingh7262]

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

[@mamatanayak6739]

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

[@user-xr9qo6bi2z]

you are the best teacher

[@rudratejjadhav911]

👌👌 great lecture easy to learn

[@abhishekmahawadi7670]

Good and easy explanation

[@anmolkesharwani8208]

great work ma'am

[@rituvishwkarma1887]

Thank you so much mam for solving this problem

[@patelshubhamkumar6263]

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

[@dheerajnemalikanti3703]

Great work didi !!

[@SAM-mug]

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

[@falonlisten3269]

Thank you Jenny

[@wasit-shafi]

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

[@cri789]

Mind blowing explainition

[@pdivyapdivya7455]

Really exllent teaching mam

[@sejaaaa3993]

Dayumm best video

[@utkarshkumar5349]

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.

[@biswadeepchakraborty5354]

Nicely explained

[@patricechaula3430]

Thank you Jenny.

[@anandsingh2653]

Life saver mam..tqq soooo much

[@exploreworld743]

Mind blowing sperrrrr

[@fitnesswithvaibhav]

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

[@nirajmeshram4]

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

[@nishantsaxena7500]

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

[@manav____]

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

[@user-gq1ij]

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

[@deepanaaruchamy]

Thank you Soo much it help me ah lot

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@barkhadibraahim1023]

thanks so much

[@saitejamerugu3725]

Thank you so much mam

[@navjeetkaur5742]

Thank u teacher.

[@adityadev2825]

Awesome 🔥

[@amankumaramar271]

thank you Maam

[@AdityaKumar-rt2qf]

nice explanation mam

[@shridharachari7081]

Spr teaching..

[@kartikeyvishwakarma9944]

good explanation!!

[@user-hv7li2ko7l]

I love you so much with your perfect vedios.

[@user-hv7li2ko7l]

I love you so much

[@nikhilgoyal007]

Thank you!

[@Chhiling08]

thanks a lot maam

[@akshitmangotra5370]

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

[@rammanoharkoruprolu9869]

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

[@sharonlul8181]

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

[@Orthodox19.]

I most Like and Arciate you !!!

[@PRAVH]

Thanks Mam

[@deepanaaruchamy]

Very clear

[@nishantsaxena7500]

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

[@YasirAli-sj5ql]

Thank U.

[@krishnapriya8729]

thankyou 😄

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

[@Eesayousuf833]

Thnkxx maam

[@Constantine808]

Thank you mam 🥳🥳🥳

[@vinoduppara1246]

Tomorrow is my exam Ur saviour to me

[@carameshnaragani7395]

u r beauty with brain 😍😍😍😍😍😍

[@tarunkumarmekala8217]

Thanks mam❤

[@carameshnaragani7395]

I am chartered accountant, similar concept is available in costing paper, which we will call it assignment problem

[@avikbose3849]

Great mam

[@brahmareddythumu9885]

Please upload all concepts on DAA and computer networking

[@Slientlofi]

Ammizing ❤

[@donLennin]

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

[@LogicalSharmaSupport]

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

[@singhkingsrivastav131]

Great 👍

[@ranjandas509]

Perfect explanation.......