Minimum Spanning Trees: Kruskal and Prim
Curriculum and historical examination lineage for Minimum Spanning Trees: Kruskal and Prim under Unit 3 (Greedy Algorithms and Dynamic Programming) of Design and Analysis of Algorithms (21CSC204J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
For a 6-node graph, how many number of edges is required to construct a minimum spanning tree? (A) 6 (B) 5 (C) 7 (D) 12 [1]
Which of the following is false about the kruskal's algorithm? (A) It is a greedy algorithm (B) It constructs MST by selecting edges in the increasing order of their weights (C)...
Using prims algorithm, find the cost of Minimum Spanning Tree (MST) of the given graph. [15] a. Using prims algorithm, find the cost of Minimum Spanning Tree (MST) of the given...
A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm should use? (A) Breadth first...
Consider the following cityscape challenge. Imagine a miniature archipelago of seven islands (lets name them A thro G). The local government want to build bridges between there...
Examinations where questions for Minimum Spanning Trees: Kruskal and Prim have appeared.
Master Minimum Spanning Trees: Kruskal and Prim in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.