Adjacency Matrix | Prim's & Kruskal Algorithm Hindi IGNOU BCS042
HTML-код
- Опубликовано: 7 окт 2024
- Adjacency Matrix | List (Hindi) | Prim's and Kruskal Algorithm (Hindi) | IGNOU BCS042 Video Tutorial
Adjacency Matrix | Prim's & Kruskal Algorithm Hindi IGNOU BCS042 #ignouexams #ignoubca #bcs042 #bca
#bcs042tutorial
#bcs042importantquestions
#ignoubcs042,
#bcs042introductiontoalgorithmdesign
#adjacencymatrixhindi
#adjacencylisthindi
#spanningtreehindi
#minimalspanningtreehindi
#primsalgorithmhindi
#kruskalalgorthmhindi
IGNOU BCA JUNE 2018 MCS 042 previous year question:
Q1: part D : Write Adjacency list and Adjacency matrix
representation for the following graph :
Q4 Write any two applications of spanning tree.
Write Prim's algorithm and apply it to find the
minimum cost spanning tree for the following
graph:
In this video tutorial, i will solve the bcs042 december 2018 ignou exam paper. i will solve 3a question of 7 marks. I will explain the problem in hindi. Then the meaning of knapsack followed by what is optimal solution means. what are the various ways of finding the solution and picking the best one.
Tips to clear your exam and study better:
1. notebook use karo, screenshot lo video k tan ki tum question samajh k khud implement kar sako
2. apne doston k saath mil k question solve karo tan ki agar kahi fas jao toh ek dusre ki madad kar sako
3. agar aap pura video nai dekhna chahte toh mei aapko suggest karunga k video 1.25x or 1.5x speed par dekhe.
4. Shaant mann aur dridh nischay k saath padhna shuru karo, agar koi mushkil ho toh comment kar k mujhse puch lo.
Agar pura topic nai dekhna chahte toh aap siddha main topics pe jump kar sakte ho...
At 0:40 Knapsack kya hota hai, ye smjhaya hai.
At 1:27, question ko smjhaya hai..
At 03:50, 05:20 Optimal Solution kya hota hai, woh smjhaya hai..
Follow us on Facebook : / naveencoachi. .
Follow Us On Instagram: / naveen_webncc
Visit out website to know more about us:
www.webncc.in/
bcs 042 tutorial,bcs 042 important questions,bcs 042 previous year question solved,ignou bcs 042,bca ignou classes,ignou exam preparation,ignou exam preparation 2020,adjacency matrix,adjacency matrices graph,prims algorithm for minimum spanning trees,prims algo,prims algo for minimum spanning tree in hindi,adjacency matrix in hindi,kruskal algo,kruskal,kruskal algorithm for minimum spanning trees,kruskal algo in hindi,bcs042 tutorial hindi,ignou tutorial hindi,,bcs042 tutorial hindi,bca exam 2023,ignou bcs 042 answers,bcs 042 important topics
IGNOU BCA JUNE 2018 MCS 042 previous year question:
Q1: part D : Write Adjacency list and Adjacency matrix
representation for the following graph :
Q4 Write any two applications of spanning tree.
Write Prim's algorithm and apply it to find the
minimum cost spanning tree for the following
graph:
Prim's answer will also be 12. In prim's if let's say we go from A to B in the first step then it doesnt mean we can only select the next vertex from B. We can select next vertex from A also if it has lesser cost than whatever is connected to B.
So in this example, it will be:
AD, DB, BE, EC, then DF (instead of CF)
So Minimum cost = 1+2+4+2+3=12
So basically at anytime, we select the minimum cost edge provided it does not disconnect the graph or create a cycle/loop.
Y video bhot mst thi ❤👀 3 imp topics cover 📔
Thank you for liking…
Thank you sir
thank you so much naveen sir god bless you and aap u hi hum sab ka saath dete rahe..
your Welcome.. Yuvrajj....
One of the best and easiest way,
Superb sir
And thanks to teach us in baid condition. 👏👏👏👏🙏🙏😘😘🙏🙏🙏🙏🙏❤️❤️❤️❤️❤️
It's my pleasure
sir app aur question tee solve kijiye na 1 month bad xam he
Sir really helpful ♥️♥️♥️ thanxx a lot 🌸
Maza aa gaya sir.
Thank you sir 😊
Great 😀
Thanks 😁
please make videos wid cover all topics in easy way
Will do my best to do this...
In PRIM’s last C-F 7 hai C-F kyu nhi kia wo to 4 hi h
From Prims or Kruskal answer should be same. So your prims method is wrong
no they do not produce the same MST. Yes they both produce the MST but the MST may not be same.
Sir, In prims we see the minimum from previous visited nodes also so from D to F edge will be connected which has weight 3
Sir prim's algo ka answer 12 units bhi aa raha h
Tumney Prims ka Answer galat nikaal hai. Kruskal or prism ka answer same aata hai.
Tumney Prism galat kia hai.
Thq sir
U r god for ignou algo student sir 😊
Sir febuary me mera algo ka exam hai
Ap Sare Q paper solve kra digiye tb tk
Koshish karunga for sure ... thanks a lot for appreciation but I m no god . Just sir is enough for the respect and praise ....👏👏👍
Thq so much sir frm my heart
Apne reply diya mujhe bahut acha lga, Q ki akshar tutor reply nhi dete h, cmmnt ka
Apne Es video me bahut hi easy way me smjhaya. Mujhe algo bahut tough lgta tha, lekin ye topic mujhe easy way me smj aa gya
Ap jrur kosish kre sir ki
Jada se jada algo k topic ko Jan last tk cover kr de
❤🙏
Sir sab question me same structure banega ya different
Kaun se question mei ?? Waise structure same rehta hai. Values based on question change hoti ha
@@NaveenMishraSir kruskal or prims me sir
@@FreakyGamerOG patteran same rahega.. woh toh algorithm hai na, woh thode change ho jayegi. question based answer will be different
You look like harsh banewal
😅👍
Sir ye sab use kidar hota real life me
😆😆😁
Network designing and travelling salesman
Adjacency list more question
Will make one more video of this topic.
sir thodA sa saaf likh dege to koi bura ni manega.