Course Content

Other Courses

Tribhuvan university CSIT 2074 Syllabus Design and Analysis of Algorithms Old Questions 2075

Design and Analysis of Algorithms - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

6.  Explain the Kruskal’s algorithm for computing spanning tree of weighted connected graph with an example of seven nodes graph.

8 marks
Asked in 2075

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...