Traveling Salesman Problem using Dynamic Programming | DAA

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

[@sunnybambooflute]

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

[@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 KZbin for this topic. Thanks so much!

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

[@Nam_David]

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

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

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

[@rohan8758]

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

[@irishjoybvillanueva8417]

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

[@gidartsproduction5439]

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

[@haadbajwa7565]

Mathematics makes a simple problem so complicated

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

[@ezraslifes]

Did you pass final year? What are you doing now? Any job Or business just curious😝 to know

[@RathourShubham]

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

[@arvindg553]

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

[@nirmaltom4424]

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

[@warriorforsure]

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

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

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

[@bhavanipandugah4455]

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

[@SAM-mug]

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

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

[@patelshubhamkumar6263]

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

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

[@shrinathgaikwad8028]

Great teaching techniques and skills 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

[@4thsemlab]

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

[@Paplu4949]

Thank you Didi concept ko achche se samjhane ke liye

[@LogicalSharmaSupport]

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

[@RahulKumar-ck1hr]

Got exactly what I was looking for... Thanks

[@afifafathima9042]

Best teacher for this daa subject ❤

[@vobensingh8404]

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

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

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

[@aidaahmadiaraghi]

you are the best teacher

[@vinoduppara1246]

Tomorrow is my exam Ur saviour to me

[@prayagpatel5887]

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

[@abhishekmahawadi7670]

Good and easy explanation

[@amritpalsingh7262]

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

[@bhavana.hgowda27]

Mam ur teaching is just amazing😊

[@sharonlul8181]

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

[@pdivyapdivya7455]

Really exllent teaching mam

[@yatinplays7606]

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

[@santhoshk2722]

Helped me a lot Thank you

[@yuvaraj9268]

Explained beautifully, thank you 🙂🙏

[@jatinkhanna6681]

Excellent work mam god bless you

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

[@nnithinreddy7480]

thank you mam it is helpful for me to do the problem in easy way thank you mam

[@mamatanayak6739]

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

[@mygchrome9135]

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

[@falonlisten3269]

Thank you Jenny

[@obsinankebebe6567]

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

[@Aditya-dv5wg]

Excellent teacher and teaching style🔥🔥🔥🔥

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

[@iamrising7176]

You are the best, Jenny.

[@nishantsaxena7500]

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

[@saieedkaiser8830]

In detail explanation ...hats off to u

[@dheerajnemalikanti3703]

Great work didi !!

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

[@poojatikhe2046]

Very good explanation thank a lot.

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

[@brahmareddythumu9885]

Please upload all concepts on DAA and computer networking

[@esgmodiyt1359]

Mam aapse pyar ho gya h😍😍

[@SS40519]

Love you 😘😘 and your teaching skills

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

[@isaacade2075]

Amazing teacher. Wow

[@nirajmeshram4]

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

[@JennyslecturesCSIT]

Thanks😊

[@nirajmeshram4]

@@JennyslecturesCSIT your welcome

[@tejaskumarknayak537]

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

[@ashishgarg7775]

super, a unique DP question

[@AmitKumar-ub3ev]

Loved the way

[@reyvanadryan2513]

Thanks a lot, i do appreciate 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 😂😂...

[@sireeshauppala2084]

very clear explanation mam ,thank you

[@rudratejjadhav911]

👌👌 great lecture easy to learn

[@anmolkesharwani8208]

great work ma'am

[@sudinkirtan3993]

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

[@user-hv7li2ko7l]

I love you so much with your perfect vedios.

[@user-hv7li2ko7l]

I love you so much

[@cri789]

Mind blowing explainition

[@biswadeepchakraborty5354]

Nicely explained

[@nirajmeshram4]

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

[@MSSKEERTHIKAK]

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

[@rituvishwkarma1887]

Thank you so much mam for solving this problem

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@anandsingh2653]

Life saver mam..tqq soooo much

[@donLennin]

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

[@deepanaaruchamy]

Thank you Soo much it help me ah lot

[@AdityaKumar-rt2qf]

nice explanation mam

[@yatri6329]

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

[@exploreworld743]

Mind blowing sperrrrr

[@ashvend]

Mam, Please make a video on the branch and bound

[@Singwithibi]

Splendid explanation ! Thank you so much for the video.

[@thatsthething3218]

I understand basics from your channel.

[@sejal_0438]

Dayumm best video

[@rammanoharkoruprolu9869]

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

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

[@rajat_enzyme]

You're really so cute ❤️ Your methodology of teaching is like a friend 🙂... Keep it up ! 🤘

[@gatecomputerscience1484]

Rajat Mittal , please subscribe my channel

[@shashikantkumar1417]

Her eyes can easily attract me😂😂

[@alwaysaditi2001]

Very helpful, thank you!

[@shridharachari7081]

Spr teaching..

[@adityadev2825]

Awesome 🔥