This question displays one of 10 graphs. It asks the student to either
\n(a) count the vertices, or
\n(b) count the edges, or
\n(c) state how many vertices a spanning tree would contain, or
\n(d) state how many edges a spanning tree would contain, or
\n(e) state the degree of a selected (randomly chosen) vertex.
", "licence": "Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International"}, "statement": "{image('resources/question-resources/'+imagelist[imagechoice])}
\n", "advice": "{advice}
", "rulesets": {}, "extensions": [], "variables": {"imagelist": {"name": "imagelist", "group": "Ungrouped variables", "definition": "[\n \"network1.png\",\"network2_DIAdEDD.jpg\",\"network2.png\",\n \"network2a.png\",\"network3.png\", \"network4.png\",\n \"network5.png\", \"network6.png\", \"network7.png\", \"network8.png\"\n ]", "description": "", "templateType": "anything"}, "parameter": {"name": "parameter", "group": "Ungrouped variables", "definition": "[\"How many vertices does this network have?\",\n \"How many edges does this network have?\",\n \"How many vertices would be in a spanning tree for this network?\",\n \"How many edges would be in a spanning tree for this network?\"\n \"What is the degree of vertex \" + vertexlist[vertexchoice] + \"?\",\n]", "description": "", "templateType": "anything"}, "vertexlist": {"name": "vertexlist", "group": "Ungrouped variables", "definition": "[\"A\",\"B\",\"C\",\"D\",\"E\"]", "description": "", "templateType": "anything"}, "imagechoice": {"name": "imagechoice", "group": "Ungrouped variables", "definition": "random(0..9)", "description": "", "templateType": "anything"}, "vertexchoice": {"name": "vertexchoice", "group": "Ungrouped variables", "definition": "random(0..2)", "description": "", "templateType": "anything"}, "parameterchoice": {"name": "parameterchoice", "group": "Ungrouped variables", "definition": "random(0..4)", "description": "", "templateType": "anything"}, "answerlist": {"name": "answerlist", "group": "Ungrouped variables", "definition": "[\n[5,7,5,4,2,4,3,2,3],\n[7,13,7,6,2,4,4,5,4],\n[5,9,5,4,4,5,5,2,2],\n[7,12,7,6,2,4,4,5,3],\n[6,10,6,5,4,3,3,5,2],\n[6,9,6,5,2,3,4,2,3],\n[5,8,5,4,3,3,3,3,4],\n[6,8,6,5,3,4,2,2,2],\n[7,13,7,6,3,3,3,6,3],\n[9,11,9,8,2,3,1,3,2]\n]", "description": "Answers to each question for each image.
", "templateType": "anything"}, "answer": {"name": "answer", "group": "Ungrouped variables", "definition": "answerlist[imagechoice][if(parameterchoice<4,parameterchoice,parameterchoice+vertexchoice)]", "description": "", "templateType": "anything"}, "advicelist": {"name": "advicelist", "group": "Ungrouped variables", "definition": "[\n \"There are {answer} vertices. You just count them.\",\n \"There are {answer} edges. You just count them.\",\n \"Since there are {answer} vertices in the network, there must be {answer} vertices in the spanning tree.\",\n \"The spanning tree has one less edge than vertices. Since there are {answer+1} vertices in the network, there will be {answer+1} vertices in the spanning tree, so there will be {answer} edges in the spanning tree.\",\n \"The vertex degree is the number of edge ends attached to the vertex. Vertex {vertexlist[vertexchoice]} has {answer} edge ends attached, so its degree is {answer}.\"\n ]", "description": "", "templateType": "anything"}, "advice": {"name": "advice", "group": "Ungrouped variables", "definition": "advicelist[parameterchoice]", "description": "", "templateType": "anything"}}, "variablesTest": {"condition": "", "maxRuns": 100}, "ungrouped_variables": ["imagelist", "parameter", "vertexlist", "imagechoice", "vertexchoice", "parameterchoice", "answerlist", "answer", "advicelist", "advice"], "variable_groups": [], "functions": {}, "preamble": {"js": "", "css": ""}, "parts": [{"type": "numberentry", "useCustomName": false, "customName": "", "marks": 1, "scripts": {}, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": true, "showFeedbackIcon": true, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "prompt": "{parameter[parameterchoice]}
", "minValue": "{answer}", "maxValue": "{answer}", "correctAnswerFraction": false, "allowFractions": false, "mustBeReduced": false, "mustBeReducedPC": 0, "showFractionHint": true, "notationStyles": ["plain", "en", "si-en"], "correctAnswerStyle": "plain"}], "partsMode": "all", "maxMarks": 0, "objectives": [], "penalties": [], "objectiveVisibility": "always", "penaltyVisibility": "always", "contributors": [{"name": "Merryn Horrocks", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/4052/"}, {"name": "Stephen Maher", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/9339/"}]}]}], "contributors": [{"name": "Merryn Horrocks", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/4052/"}, {"name": "Stephen Maher", "profile_url": "https://numbas.mathcentre.ac.uk/accounts/profile/9339/"}]}