Minimum Spanning Trees and Greedy Algorithms (VCE SSCE General Mathematics): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
Which property is NOT characteristic of a tree?
Which property is NOT characteristic of a tree?
Contains cycles
If a tree has vertices, how many edges does it have?
If a tree has vertices, how many edges does it have?
How many edges does a spanning tree need if the graph has vertices?
How many edges does a spanning tree need if the graph has vertices?
What is a minimum spanning tree?
What is a minimum spanning tree?
A spanning tree with smallest total weight
What's the key difference between MST and shortest path problems?
What's the key difference between MST and shortest path problems?
MST connects ALL vertices; path links TWO
In Prim's algorithm, where do you select the next edge from?
In Prim's algorithm, where do you select the next edge from?
Vertices already in the tree
In Kruskal's algorithm, how do you select edges?
In Kruskal's algorithm, how do you select edges?
Smallest weight anywhere, avoiding cycles
How does Prim's algorithm differ from Kruskal's?
How does Prim's algorithm differ from Kruskal's?
Prim's expands from one vertex outward
What defines a greedy algorithm?
What defines a greedy algorithm?
Makes best choice at each step
What does Dijkstra's algorithm find?
What does Dijkstra's algorithm find?
Shortest path between two specific vertices