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 .
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
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....😊😊😊
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...
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 😊😊
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
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.
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 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 😂😂...
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 ...
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
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 .
this is again the easiest-to-understand video I found. Thank you Jenny!
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
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
😂😂😂😂😂😂
Awesome and intuitive explanation that beats all the others I found on RUclips for this topic. Thanks so much!
Seeing this before my seminar now I feel confident, Thanks a lot Mam ❤
Aaya hai bhai
Dil vala emoji
Kya baat ha bhai
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
i did not skip the ads because u have really taught me.
your explanation is too good & you deliver your knowledge in simple terms, thank you madam..
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 ❤️❤️❤️❤️
Did you pass final year? What are you doing now? Any job Or business just curious😝 to know
I have been watch tutorials for years and thankfully I found a helpful channel. Keep up with good work.
Aaapki awaaj me suru me itni sehmi sehmi se thi...aur last me boom boom...you are sweet so..❤️❤️... thanks
👏🏻👏🏻👏🏻 Better than our college faculty....Thank you mam.. Worth subscribing.. Worth video 👍👍🤓❤️
Only vedio only which explain the formula
Thank you ma'am ❤️
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....😊😊😊
beauty with brain❤️❤️❤️
Edited : U too take care!!!
I watched this vedio before my exam and got full marks.... thank you so much madam
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
Best teacher for this daa subject ❤
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...
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 😊😊
Mathematics makes a simple problem so complicated
Wah yr kamal ker diya apne tu... Mujhy samajh aa gya 😃
😀 kal mst hai mera aaj iss video ko dekhne k baad lag raha hai ye sab easy hai
The best teacher ever...
Give like if u also like the way ma'am teaches!!
I got very good faculty here, I can understand easy way. Thankyou ma'am
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
Great teaching techniques and skills mam
you are the best teacher
Best class mam where we never disappointed. 👌❣️❣️❣️
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.
Tomorrow is my exam Ur saviour to me
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 ❤️❤️😍😍😘😘😘😘😘
Mam ur teaching is just amazing😊
Got exactly what I was looking for... Thanks
Love you mam. And also love your effort to make topic simple.
Really exllent teaching mam
Good Work jenny .. hope soon your subscribers or views will be in millions :)
Thank you Jenny
Mam app kitne cute ho🤧 sab samaj agaya vaise thx🤧
Helped me a lot Thank you
Explained beautifully, thank you 🙂🙏
thank you mam it is helpful for me to do the problem in easy way thank you mam
Excellent teacher and teaching style🔥🔥🔥🔥
Many many thank you mam .excellent your explain travelling sales man problem .
Great video👌😍, plz upload a series on Fibonacci heap and binomial heap
I'll greatly appreciate it.
Thanks 🙏
Really, I appreciate this lecture video incase of its more understandable. 10q jenny's am with you when ever I am in Cs.
Excellent work mam god bless you
Good and easy explanation
You are the best, Jenny.
In detail explanation ...hats off to u
You rock Jenny Lamba! You made this problem so easy! Amazing explanation by a very attractive lady! Keep it up!
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.
In our clg the lectures have this much beautiful even our boys didn't miss one class also 😂
Love you 😘😘 and your teaching skills
Great work didi !!
very clear explanation mam ,thank you
Very good explanation thank a lot.
Amazing teacher. Wow
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 😂😂...
bhot bhot bhot bhot bhot bhot thankyou...............................................
Mind blowing explainition
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 ...
Please upload all concepts on DAA and computer networking
excellent mam......................................
Thanks😊
@@JennyslecturesCSIT your welcome
super, a unique DP question
Thank you so much mam for solving this problem
Ma'am please make a video on N-Queen problem. You helps us a lot ma'am.
Loved the way
Life saver mam..tqq soooo much
I love you so much with your perfect vedios.
I love you so much
Mam aapse pyar ho gya h😍😍
👌👌 great lecture easy to learn
You're really so cute ❤️ Your methodology of teaching is like a friend 🙂... Keep it up ! 🤘
Rajat Mittal , please subscribe my channel
Nicely explained
Thank you Soo much it help me ah lot
This method is awesome....compare to coloum and row reduction method .....anyways thanks mam...
great work ma'am
Thanks a lot, i do appreciate this!
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"
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
NICE SUPER EXCELLENT MOTIVATED
Thank you Jenny.
Not looking on the solution but start to end only see the man😅
Dayumm best video
Spr teaching..
thank you Maam
Mind blowing sperrrrr
Mam, Please make a video on the branch and bound
Thank you so much mam!! Such a good explanation!! ❤
nice explanation mam
Very clear
Plz make videos on service to product based company switch.....&video on Graph theory,Bit manipulation
Perfect explanation.......
@Jenny's lectures CS/IT NET&JRF You should do a video on the proof of the complexity for this method.
Thank u teacher.
Thank you mam 🥳🥳🥳
Thanks Mam