← All topics
Quiz: Minimum Spanning Trees: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. A connected graph has 8 nodes. How many edges does any spanning tree of it have?
- Q2. In Kruskal's algorithm, an edge u–v is skipped when:
- Q3. What does this print? (code)
- Q4. Which data structure makes Kruskal's cycle check fast?
- Q5. Prim's algorithm, at each step, adds:
- Q6. What does this print? (code)
- Q7. Why does an MST never contain a cycle?
- Q8. A graph has several edges with equal weights. Which statement is true?
- Q9. What is the time complexity of Kruskal's algorithm?
- Q10. Which problem is solved by a minimum spanning tree?