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

😂😂😂😂😂😂

[@RathourShubham]

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

[@sunnybambooflute]

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

[@yatinplays7606]

Mam app kitne cute ho🤧 sab samaj agaya vaise thx🤧

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

[@shalsteven]

Where is the dynamic programming part of this solution? Did you store any previous calculated value?

[@ddjampani5480]

There is no such case for storing and reusing bro, it is just a recursive approach

[@shalsteven]

@@ddjampani5480 this video title is "dynamic programming"

[@himanshumangoli6708]

How time complexity is order of n to the power n

[@crazydrifter13]

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.

[@juanj.sanchez2216]

I came to learn optimization and ended up falling in love with the beautiful lady 😞

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

[@joels978]

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

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

[@sharonlul8181]

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

[@rohan8758]

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

[@santhoshk2722]

Helped me a lot Thank you

[@supriya3665]

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

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

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

[@esgmodiyt1359]

Mam aapse pyar ho gya h😍😍

[@supernova7870]

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

[@digitalnomad303]

DP should be removed from the video title.

[@girishdama1778]

Yes, same doubt 🧐

[@aidaahmadiaraghi]

you are the best teacher

[@falonlisten3269]

Thank you Jenny

[@tppt3987]

You're too cute.

[@biswadeepchakraborty5354]

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]

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.

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

[@nirmaltom4424]

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

[@NitinKumarVasdhani]

Ma'am last vo A pe vapis toh lotke aaya hi nahi ma'am🙄🙄

[@levi-lb6dp]

Mam starting me appke awaaz ko kya ho jata hai bohot irrating lgta hai

[@cri789]

Mind blowing explainition

[@irishjoybvillanueva8417]

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

[@shaikzohab2967]

Can we choose any one method or two methods ?

[@amritpalsingh7262]

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

[@shashikantkumar1417]

Her eyes can easily attract me😂😂

[@NaveenPGForYou]

How was the matrix calculated? Why is A to B 16 and reverse just 8? This is not clear.

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

[@shrinathgaikwad8028]

Great teaching techniques and skills mam

[@brahmareddythumu9885]

Please upload all concepts on DAA and computer networking

[@SASIPRATHEEK]

Oh 🎉 Jenny:

[@haadbajwa7565]

Mathematics makes a simple problem so complicated

[@johnmctavish1021]

Isn't this essentially Brute-Force only? You essentially analyzed all possible paths.

[@nishantsaxena7500]

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

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

[@Nam_David]

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

[@abhishekmahawadi7670]

Good and easy explanation

[@VinodThakurGaming]

Shimla 😌 I live in Shimla 😅 ..

[@RahulKumar-ck1hr]

Got exactly what I was looking for... Thanks

[@nirajmeshram4]

excellent mam......................................

[@JennyslecturesCSIT]

Thanks😊

[@nirajmeshram4]

@@JennyslecturesCSIT your welcome

[@likhithanarayanaswamy8538]

Mam plz explain multistage graph in dynamic programming

[@rx_100_mathesh]

You are very cute 💋

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@sunguru981]

Could this be solved via Dijkstra algorithm ? Because it resembles like that..

[@050138]

Dijkstra algorithm.... ♥️ Had to learn it in my MATLAB in my masters to solve a transportation problem using Dijkstra algorithm.... What beautiful memories! ☺️

[@jawadkazim6610]

Mam starting mai aram se bolti hai phir form mai ajaaati hai 😆 #shimla

[@newplaylist-oc3kx]

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.

[@reyvanadryan2513]

Thanks a lot, i do appreciate this!

[@AmitKumar-ub3ev]

Loved the way

[@yaredasmat3263]

why is A to B and B to A not similar.

[@coder_abhi]

It can be different, like going by cycle 🚲 and coming by bike 🛵

[@srujanwankhede5314]

I have one doubt .. why is dynamic programming named here there is no repetitive processing done in this approach .. this is a simple recursion problem .. plx explain an thankyou for explaining 🙏🙏🙏

[@ashvend]

Mam, Please make a video on the branch and bound

[@mayanktripathi3915]

Could you please share code in java..

[@anshuprakash5022]

madam jii please implement krke v samjha dijiye c++ me,bohot shukrgujar rhunga

[@prayagpatel5887]

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

[@smtownofficial7918]

Subha subha aapka face dekha hai paper accha jaan Chahiye brna soch lio dislike kr dunga 🙂

[@mohammedtayyab4959]

That problem is in dynamic.. What we do when problem is in branch and bound

[@mohammedtayyab4959]

March 1 and blue dress at Diwali and sunrise can't wait 🤔🤔

[@jawadkazim6610]

Abdul bari ke pas jao 😂

[@mohammedtayyab4959]

@@jawadkazim6610 gaya thaa unkaynpaas bechara nahi dekha 😂😂

[@yuvaraj9268]

Explained beautifully, thank you 🙂🙏

[@NAYANACN-f9o]

Can u please explain kanapsack problem using branch bound

[@rajeshgowda1727]

explanation is too good.I think matrix values is not similar eg: w(A,B)=16 hence W(B,A) should be 16 right.

[@noorfatima8524]

Rajesh Gowda it is not always true that weight should be similar... in a graph cost of (a,b) and (b,a) can be different. its just an example.

[@JennyslecturesCSIT]

No it's not always true... Weight of edges will be given in question..I have taken just an example.

[@poornachandra4348]

Pls upload program for this

[@petrifiedmach]

I came here with full enthusiasm to study TSP because Red Black Trees wasn't interesting enough ( tomorrow's my exam ), and Jayanti begins with such a soft voice 😂😂...

[@arbazansari7696]

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

[@yatri6329]

Plz make videos on service to product based company switch.....&video on Graph theory,Bit manipulation

[@panche_short]

Not looking on the solution but start to end only see the man😅

[@Anuragsharma-gf8xy]

Why distance between a to b is not same as b to a, can you help

[@poojatikhe2046]

Very good explanation thank a lot.

[@LogicalSharmaSupport]

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

[@madhumathi5528]

Mam please take about ford fulkarson method problem.i didn't get any clear picture about this problem.please

[@usmanbhattis7881]

YOU'RE SO BEAUTIFULL

[@saumikroy3853]

You are soo sweet mam❤❤❤ You are my love Can you marry me?

[@LegendBoy99999]

🔥🔥🔥🔥

[@jatinkhanna6681]

Excellent work mam god bless you

[@shivbali9837]

Will you explain this problem with different example, ie more than 6 nodes, I am fed-up with this common example

[@raihanhafiz1221]

Please Make video on computer networks.

[@ItsAnu276]

Mam please upload a video of tsp problem using branch and bound plse soon mam

[@iotvasu5017]

beauty💝💝💝💝

[@gjajeetukumar8821]

♥️♥️

[@obsinankebebe6567]

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

[@vinoduppara1246]

Tomorrow is my exam Ur saviour to me

[@arvindg553]

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

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

[@Mavihs_Rocks]

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 !

[@exploreworld743]

Mind blowing sperrrrr

[@kothabrahmanandareddy6219]

you look cute😍😍😍

[@tejaskumarknayak537]

In our clg the lectures have this much beautiful even our boys didn't miss one class also 😂

[@naveenp6883]

Looking soooo cute mam fan of ur face glow

[@pdivyapdivya7455]

Really exllent teaching mam

[@sudinkirtan3993]

Ma'am please make a video on N-Queen problem. You helps us a lot ma'am.

[@suparnasadhu7994]

Hello mam, can u pls give the link for travelling salesman problem using brute-force method and using branch and bound? I am not finding.

[@ddjampani5480]

It is just a recursive approach , there is no dynamic programming in it

[@mr.prathu.s3212]

Mam can you make traveling salesman problem by branch n bound technique

[@nunugondahansika9116]

By which method we have to solve in xam mam by brute force or formula

[@shubhamramola6874]

Mam aapse padke to pkka pass Ho jaunga daa me