Spanning Trees
Authored by Monika Davis
Other
9th - 12th Grade
Used 308+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The graph shown contains NO cycles.
True
False
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The graph shown contains NO cycles.
True
False
3.
MULTIPLE SELECT QUESTION
30 sec • 1 pt
Which of the following statements are TRUE about a minimal spanning tree?
Each branch has a weight.
Contains no cycles.
All vertices are connected.
The path results in the minimum total weight.
4.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
Create a minimal spanning tree, then find the minimum total cost.
30
39
47
50
5.
MULTIPLE CHOICE QUESTION
15 mins • 1 pt
Create a minimal spanning tree, then find the minimum total cost.
20
21
22
23
6.
MULTIPLE CHOICE QUESTION
5 mins • 1 pt
The number of vertices in a tree with 12 edges is
7.
MULTIPLE CHOICE QUESTION
5 mins • 1 pt
Using Kruskal’s algorithm, which edge should you choose second?
AE
BD
DE
AB
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 Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
