2022-2023.M.9.PrimKruskal
Authored by Lantz Charles
Mathematics
9th - 12th Grade
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
9 questions
Show all answers
1.
DRAW QUESTION
3 mins • 1 pt
Use Kruskal's Algorithm to find the minimum spanning tree. Write the edges you used and the weight.
Use Prim's Algorithm to determine the minimum spanning tree. Write the edges you used and the weight. Start at Vertex A.
2.
OPEN ENDED QUESTION
3 mins • 1 pt
1) Use Kruskal's Algorithm to find the minimum spanning tree. Write the edges you used and the weight.
2) Use Prim's Algorithm to determine the minimum spanning tree. Write the edges you used and the weight. Start at Vertex A.
3) What is the weight of the Minimum Spanning tree?
Evaluate responses using AI:
OFF
3.
MULTIPLE CHOICE QUESTION
5 mins • 1 pt
What is the weight of the Minimum Spanning tree?
4.
OPEN ENDED QUESTION
3 mins • 1 pt
What is the weight of the Minimum Spanning tree?
What method did you use to determine the weight? Circle your answer: [Kruskal / Prim]
Evaluate responses using AI:
OFF
5.
OPEN ENDED QUESTION
3 mins • 1 pt
What is the weight of the Minimum Spanning tree?
Evaluate responses using AI:
OFF
6.
OPEN ENDED QUESTION
3 mins • 1 pt
What is the weight of the Minimum Spanning tree?
Evaluate responses using AI:
OFF
7.
MULTIPLE CHOICE QUESTION
5 mins • 1 pt
The number of edges in a tree with 32 vertices is
30
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
Already have an account?
