how well she teaches! when you start playing her lecture you can be completely contented(NISHCHINT!) that after watching her video you will not have to wander anywhere else on youtube! she deserves quite more than her present subscribers 1.54M
Many of the TH-camrs don't tell that we have to check minimum weight among all of those visited vertices. They just take the last visited one. Thank you Ma'am
You are such a great tutor I am following you for more concepts I am now very proud to be in your lecture You are giving such an huge knowledge about the concept
00:03 Prims algorithm for finding minimum spanning tree 01:23 Remove parallel edges in this graph 02:34 Minimum Spanning Tree algorithm explained 03:59 There are incident edges and outgoing edges from vertex B. 05:12 Choose the edge with the minimum weight 06:30 Choose the vertex with the minimum weight 07:49 Prims algorithm can be used to find the minimum spanning tree of a graph. 09:17 Minimum Spanning Tree Crafted by Merlin AI.
Very nice Explaination , definitely this channel is going to become bigger educational channel and it helps many students like us. Keep going , All the best madam
mam make video on these,asked in our internal exam... (1) Define activity selection and activity selection explain using greedy strategic (2)Counting sort explain (3)Max flow network using ford fulkerson algorithm (4) Red black tree Wiaiting for these videos on your channel mam..board exam is next week and I am waiting for these one
Steps for prims algorithm; 1. First check if graph contains a loop edge or parallel edge. 2. If it contains loop edge,remove them. 3. If it contains parallel edge,remove the parallel edge that is having more cost. 4. Now,Select any node and from that find the edge having minimum cost and in all steps we have to check previous steps edges that are not selected for minimum cost. Follow the steps till vertices in minimum spanning tree and original graph is same.
I'm seriously obsessed with your videos, they help understand me alot of important topics. Please upload videos on competitive coding as well. Thank you ma'am for all your efforts, you are doing amazing work.
Where, by the rule of not having cycles in the spanning tree i may get the mst But in a complete graph having 4 vertices how should I get 16 spanning trees without cycles
Love you, mam. Thank you so much. I have my exam in 4 hrs and this is so helpful. Keep up the good work. Soon you'll get many more subscribers. You can make some videos on some other subjects too(if possible).
Mam. Your teaching is very interesting and easy .You teached in English and some other language we can't understand that language 😢. lots students know only English so you can teach only in English is helpful for all students.....😊
if a graph has only one minimum spanning tree, choosing any arbitary edge, in the beginning, may not lead to the correct answer. Suppose I chose an edge with maximum weight and it is not a part of the minimum spanning tree then I will never get the correct answer.
bro anyhow u need to choose that vertex when ur constructing the mst so i guess it wouldnt make any difference, cause all the vertices should be present in mst just like original graph. correct me if i am wrong.
Thank you mam matlab kitna acha hai na ki aap aur mai aap padao mai pdta jaunga kitna acha lgta hai apka smjhaya sab smjh mai aata hai we need this type of teachers❤❤
Great explanation and even cuter smile. Thanks for your videos. I may only suggest to use less of Hindi in the future so your non-Indian audience understands better.
Thanks, mam, you have covered the all-important topic for IGNOU MCA and BCA student. And this very helpful for me and all IGNOU MCA and BCA student. thank again :)
It is already a bit challenging to understand the English accent, and the teacher occasionally switches to Hindi. This is the only aspect I find difficult; everything else is perfect.
What’s the time complexity for this algo? Seems n! My opinion that you should use MST set to track the visited nodes and vertex & keys object to store the shortest distance or weight, then you no need to visit the nodes again and again…!!
Thanks a lot for your videos but please please keep speaking in english in some times you are speking in hindu i cant consider what are you talking about a lot thanks form Uzbekistan :)
how well she teaches!
when you start playing her lecture you can be completely contented(NISHCHINT!) that after watching her video you will not have to wander anywhere else on youtube!
she deserves quite more than her present subscribers 1.54M
Many of the TH-camrs don't tell that we have to check minimum weight among all of those visited vertices. They just take the last visited one. Thank you Ma'am
Please try to speak only in English because some people's are don't know Hindi like me
Firstly your english sucks😂
@@ALLnews43815 she only speaks hindi when she isn’t speaking about the topic / to repeat something that she already said in English.
You are such a great tutor
I am following you for more concepts
I am now very proud to be in your lecture
You are giving such an huge knowledge about the concept
00:03 Prims algorithm for finding minimum spanning tree
01:23 Remove parallel edges in this graph
02:34 Minimum Spanning Tree algorithm explained
03:59 There are incident edges and outgoing edges from vertex B.
05:12 Choose the edge with the minimum weight
06:30 Choose the vertex with the minimum weight
07:49 Prims algorithm can be used to find the minimum spanning tree of a graph.
09:17 Minimum Spanning Tree
Crafted by Merlin AI.
If I got a teacher like you, my grades will not be less than 90 out of 100 🤩😄
I am understand this topic..
Perfect explanation..
Thanks for video..maim ...
you have made learning graph theory wonderful giving very simple explanation
Tomorrow is my semister and I’m sure I’ll not miss this sum out ,, thank you soo much ma’am
Best explanation of prims algorithms.thankyou mam
Thanks mam, now I am going to complete my assignment
You way of communicating and spreading is extraordinary very well
Mam your way of. Teaching is good
Your videos are really helpful ma'am. Excellent explaination. Thank you!
Chup beth
Very nice Explaination , definitely this channel is going to become bigger educational channel and it helps many students like us.
Keep going , All the best madam
Thank you so much
Better explanation, easily understood in only one example. Thanks for giving us such helpful video.
thanks a lot mam.... today is my exam..once again thanks mam for clearing this topic
I Love you JennY 💗
u are saved my exam
Thank you ma'am 💝💖🤗♥️❤️
Many thanks! This was very helpful!
Thank you so much mam , your teaching was helpful.
Thank you
You explained very well. Thanks!
Nice 👍👌most helpful
Thanks for good lecture it is helpful
excellent explanation thanku mam for making excellent videos 👍💯
Thankyou very much our beautiful techer
Thank you so much mam
Mam please upload a video on Hash tables
Mam is a beauty
Thanks for the video. Great explanation. I have one question that how can we use top sort method using Prims Algo ?
Thanks Mam......
Thank you mam please make a video on the code of prims algorithm
Thank u ma'am
Thankyou so much😭❤️
Can u please share a video on minimum cost flow problem?
better than collage professor
mam please try to make c++ programing videos and expalanation of data structure was outstanding
Best explained
Life saver 💕💕
I have one question
If we use prim and kruskal algorithm for same graph do we get same answer or not?
You are beauty with brain
What if next smallest cost edge is making a cycle ?
Subscribed😊😊
I am grateful for the kind words and encouragement
@@JennyslecturesCSIT
You deserve more than this....
Thnx for reply....
ma'am aap khuli baalo me bahut acchi padhati ho, acche se smgh me aata hai🥰
Tq jenny ma'am i love you ❤
In parallel edge we delete maximum edge weight, so why u delete 3 instead of 6 pls explain ma'am
Why would choosing A to C edge make sense while adding choosing node after say F ? Can someone please explain ?
Discrete math ke upr video plz
Make a habit of analysing complexity also
beauty with brain dangerous combination
nice
How to solve prims algorithm with directed graph...??
Love you mam
Very gdd mam
mam make video on these,asked in our internal exam...
(1) Define activity selection and activity selection explain using greedy strategic
(2)Counting sort explain
(3)Max flow network using ford fulkerson algorithm
(4) Red black tree
Wiaiting for these videos on your channel mam..board exam is next week and I am waiting for these one
Counting sort already uploaded...check out the sorting algorithms playlist.
@@JennyslecturesCSIT ohh I just see , plz upload others video too mentioned above as soon as possible.waiting for it mam
Madam, please use only English to explain, don't switch over to Hindi. It is more inconvenience for non Hindi speaking people.
@@CMOHITSHARMA learn Hindi???? why??
@@CMOHITSHARMA if ppl dont understand what ur saying tell them in a way they'll understand dont ask them to learn the language brother
Yes
Watching her videos in 1.25 x speed is more comfortable
Me 2x🙌🏻
ive got an exam tomorrow and you just saved my life jenny
same here
Same
same
Bhai exam me bus yahi aega kya
Age bhi bohot h
Mam bolna sikho yar . Respect vi diya Karo thoda.
Steps for prims algorithm;
1. First check if graph contains a loop edge or parallel edge.
2. If it contains loop edge,remove them.
3. If it contains parallel edge,remove the parallel edge that is having more cost.
4. Now,Select any node and from that find the edge having minimum cost and in all steps we have to check previous steps edges that are not selected for minimum cost. Follow the steps till vertices in minimum spanning tree and original graph is same.
Thank you Bhai 💖
❤️😘
Bhai agar only algorithms aay 3xam mai toh kya ye likh sakte hai wo code type mai nhi likhna kya
Best
Prims algorithm should be Cycle or not ??
Jay Shree Ram
Jai shree ram
After a brilliant explanation in end of any lec that'smile gives a feel like a huge breath of confidence.😊😊😊😍😘
Heavy bucket
Are u the brother of Siddarth shukla? Coz we u look as hot as him
@@wegu9423 😂
mam what is difference between krushkal and prims algo🤔🤔🤔🤔
I'm seriously obsessed with your videos, they help understand me alot of important topics. Please upload videos on competitive coding as well. Thank you ma'am for all your efforts, you are doing amazing work.
Yes, same suggestion
tharki
Shi kha
🦆🦆🦆🦆
mam what is difference between krushkal and prims algo🤔🤔🤔🤔
Honestly you are a
Life saver!
You are the best for algorithms.
Wish your good future
mam what is difference between krushkal and prims algo🤔🤔🤔🤔
Please speak in English language mam . I don't understand hindi.😔😔😔😔
Don't use Hindi while teaching. We are watching your videos from different states. Try to teach in English only mam
Try to add captions to your videos.
mam what is difference between krushkal and prims algo🤔🤔🤔🤔
Hi Jenny ,our mam copy your teaching 😂😂😂😂😂
Couldn't interpret so clear from other professor TH-cam's tutorial.
tomorrow(11/01/2020) is my exam so i watching today,thank you so much:-)
Did u pass ?
I have a doubt, if I take B has my parent node, then how should i slove it? { Because i am unable to get six vertices}
Where, by the rule of not having cycles in the spanning tree i may get the mst
But in a complete graph having 4 vertices how should I get 16 spanning trees without cycles
Same error bro 🥲
Love you, mam. Thank you so much. I have my exam in 4 hrs and this is so helpful. Keep up the good work. Soon you'll get many more subscribers. You can make some videos on some other subjects too(if possible).
Thanks.. definitely I am going to cover most of the CS subjects. 😊
thank you mam, i got confidence in ds because of u.....i want to tell you again thank you so much.
5:20 Ma'am assume at this step the weight of B-D , C-D and C-E all three are 50. In this case we will have to select A-C, since 8
Mam. Your teaching is very interesting and easy .You teached in English and some other language we can't understand that language 😢. lots students know only English so you can teach only in English is helpful for all students.....😊
mam subah se apko loop pe dekhra like puri dsa ki playlist khatam krdi kal exam hai islie😂😂😶🌫
ek baat notice kri kisne mam ki video pr koi ad nahi aate esa kyu bhala fir enki earning kese hoti hogi
Boomer jenny
maam aap bohot cute ho👩❤️💋👨👩❤️💋👨
Thank you very much Jenny ma'am ! You did a great job ! But ma'am why kruskal's and prims seems the same ?
Procedure of both algos are different. Or u can say algorithm steps are different. But final mst can be same.
if a graph has only one minimum spanning tree, choosing any arbitary edge, in the beginning, may not lead to the correct answer. Suppose I chose an edge with maximum weight and it is not a part of the minimum spanning tree then I will never get the correct answer.
bro anyhow u need to choose that vertex when ur constructing the mst so i guess it wouldnt make any difference, cause all the vertices should be present in mst just like original graph. correct me if i am wrong.
Mam my question is that incase of directed graph what we have to do plz can u explain that...
Thank you mam matlab kitna acha hai na ki aap aur mai aap padao mai pdta jaunga kitna acha lgta hai apka smjhaya sab smjh mai aata hai we need this type of teachers❤❤
Great explanation and even cuter smile. Thanks for your videos. I may only suggest to use less of Hindi in the future so your non-Indian audience understands better.
Maam I really love your teaching style and always love you as a Good teacher ❤️❤️❤️❤️❤️❤️
Thanks, mam, you have covered the all-important topic for IGNOU MCA and BCA student. And this very helpful for me and all IGNOU MCA and BCA student. thank again :)
One thing can be improved that is your volume should increased . BDW very helpful and thank you so much. Best of luck ahead
Tere chehre a Nazar nhi hatti na jane hm kya dekhe
Very thanks mam... I just had this topic in my today's class & i have understood a far better than before 😍
Thank you so much mam..... really ur explaination is very nice .....it is very helpful to me......
Wish you only spoke English for non Indian students!
same commet for me also
It should have been a full English video. Not 50% English and 50% Hindi. There are certain parts of the video where I can't understand anything.
Your explanation is easy to understand ma'am thank you so much 😊❤️
😘😁😁🙏😁👍🙏😁🙏😁👍😁👍😁🙏👍😁👍😁👍😘👍👍😁🙄🙄😁❤️👍😁👍😁
Just doing time pass sorry😂
It is already a bit challenging to understand the English accent, and the teacher occasionally switches to Hindi. This is the only aspect I find difficult; everything else is perfect.
What’s the time complexity for this algo? Seems n!
My opinion that you should use MST set to track the visited nodes and vertex & keys object to store the shortest distance or weight, then you no need to visit the nodes again and again…!!
Mem write a algorithm for prim's and kruskal
Thanks a lot for your videos but please please keep speaking in english in some times you are speking in hindu i cant consider what are you talking about a lot thanks form Uzbekistan :)
Till now ,in my e-Learning journey i found you as a gem mine....thanks for your support ....:):):):):):)
Mam U r great outstanding 👍👍