Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
7.2k views
in Computer by (69.7k points)

Apply Kruskal's algorithm to find a minimum spanning tree of the graph in the following figure-Display execution of each step of the algorithm. 

Describe the insertion sort algorithm. Compute its asymptotic time complexity for worst case and average case. 

1 Answer

+1 vote
by (69.2k points)
selected by
 
Best answer

The given graph is name the vertices as shown.

To find minimum spanning tree of the given graph :-

Edges in increasing order of weights

Step 1 Add ‘BC’ 

Step 4 Add ‘EH’

Step 5 Add ‘AB’

Step 6 Add ‘AD’

STEP 7 Add 'DG' 

STEP 8 Add 'FI’ 

Cost of the spanning Tree= 1+2+2+1+3+1+3+1=14 This

is the required spanning tree of the given graph. 

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...