Error
There was an error loading the page.
The student is given a connected graph and must find a minimum spanning tree.
Metadata
-
England schools
-
England university
-
Scotland schools
Taxonomy: mathcentre
Taxonomy: Kind of activity
Taxonomy: Context
Contributors
Feedback
From users who are members of NCL MAS2707 :
Christian Lawson-Perfect
|
said | Needs to be tested | 3 years, 1 month ago |
History
Christian Lawson-Perfect 3 years ago
Published this.
Christian Lawson-Perfect 3 years, 1 month ago
Gave some feedback: Needs to be tested
Christian Lawson-Perfect 3 years, 1 month ago
Created this.There is only one version of this question that you have access to.
| Name | Type | Generated Value |
|---|
| n | integer |
7
|
||||
| vertex_labels | list |
List of 7 items
|
||||
| g | graph |
graph(matrix([0,1,1,0,0,1,0],[1,0,1,0,0,1,0],[1,1,0,1,0,1,0],[0,0,1,0,0,1,1],[0,0,0,0,0,1,1],[1,1,1,1,1,0,1],[0,0,0,1,1,1,0]),[ vertex(-3.5056957555, 2.0766442771, "A"), vertex(-0.9836881703, 6.3804497077, "B"), vertex(-8.3801284687, 0.9978058888, "C"), vertex(0.4291833824, -7.0183539367, "D"), vertex(7.2533607096, 0.6759628822, "E"), vertex(3.8129117198, 4.9079539028, "F"), vertex(4.8740565828, -4.5204627218, "G") ],[ edge(3, 5, 12, false, ""), edge(0, 1, 5, false, ""), edge(2, 5, 13, false, ""), edge(5, 6, 9, false, ""), edge(1, 2, 9, false, ""), edge(0, 5, 8, false, ""), edge(0, 2, 5, false, ""), edge(4, 5, 5, false, ""), edge(4, 6, 6, false, ""), edge(1, 5, 5, false, ""), edge(3, 6, 5, false, ""), edge(2, 3, 12, false, "") ])
|
||||
| min_spanning_tree | list |
Nested 6×2 list
|
||||
| min_spanning_tree_marking_matrix | list |
Nested 7×7 list
|
||||
| weight_matrix | matrix |
Matrix of size 7×7
|
||||
| minimal_weight | number |
31
|
||||
| unweighted_g | graph |
graph(matrix([0,1,1,0,0,1,0],[1,0,1,0,0,1,0],[1,1,0,1,0,1,0],[0,0,1,0,0,1,1],[0,0,0,0,0,1,1],[1,1,1,1,1,0,1],[0,0,0,1,1,1,0]),[ vertex(-3.5056957555, 2.0766442771, "A"), vertex(-0.9836881703, 6.3804497077, "B"), vertex(-8.3801284687, 0.9978058888, "C"), vertex(0.4291833824, -7.0183539367, "D"), vertex(7.2533607096, 0.6759628822, "E"), vertex(3.8129117198, 4.9079539028, "F"), vertex(4.8740565828, -4.5204627218, "G") ],[ edge(3, 5, 12, false, ""), edge(0, 1, 5, false, ""), edge(2, 5, 13, false, ""), edge(5, 6, 9, false, ""), edge(1, 2, 9, false, ""), edge(0, 5, 8, false, ""), edge(0, 2, 5, false, ""), edge(4, 5, 5, false, ""), edge(4, 6, 6, false, ""), edge(1, 5, 5, false, ""), edge(3, 6, 5, false, ""), edge(2, 3, 12, false, "") ])
|
||||
| entry_layout | list |
Nested 8×8 list
|
Generated value: integer
- entry_layout
- min_spanning_tree_marking_matrix
- minimal_weight
- unweighted_g
- vertex_labels
Match choices with answers
Ask the student a question, and give any hints about how they should answer this part.
Find a minimum spanning tree for $G$.
For each edge in your minimum spanning tree, tick the box corresponding to the vertices that the edge joins.
For each combination of answer and choice, write 1 if the student should tick it, or 0 if they should leave it unticked.
Use this tab to check that this question works as expected.
| Part | Test | Passed? |
|---|---|---|
| Match choices with answers | ||
| Hasn't run yet |
This question is used in the following exams:
- Josh's copy of Graph theory questions by Josh Lim in Josh's workspace.
- MAS2707 Graph theory practice by Chris Graham in NCL MAS2707.
- MAS2707 Numbas assessment 2 (with feedback) by Chris Graham in NCL MAS2707.
- MAS2707 Numbas assessment 2 by Christian Lawson-Perfect in NCL MAS2707.
- Graph theory questions by Christian Lawson-Perfect in Graph theory extension.
- Graph Theory Practice by Shweta Sharma in NCL MAS2707.
- Graph Theory Practice questions by Shweta Sharma in NCL MAS2707.