Course Content

Other Courses

Tribhuvan university BIT BIT Curriculum Discrete Structure Old Questions 2078

Discrete Structure - Old Questions

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

3. Define spanning tree and minimum spanning tree with suitable example. Use Kruskal's algorithms to find minimum spanning tree in the given graph.     (4+6)


10 marks
Asked in 2078

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...