// Numbas version: exam_results_page_options
{"name": "Identify the minimum spanning tree", "extensions": [], "custom_part_types": [], "resources": [["question-resources/network10.png", "/srv/numbas/media/question-resources/network10.png"], ["question-resources/network9.png", "/srv/numbas/media/question-resources/network9.png"], ["question-resources/network10_minsp.png", "/srv/numbas/media/question-resources/network10_minsp.png"], ["question-resources/network10_spt1.png", "/srv/numbas/media/question-resources/network10_spt1.png"], ["question-resources/network10_subnet.png", "/srv/numbas/media/question-resources/network10_subnet.png"], ["question-resources/network9_minsp.png", "/srv/numbas/media/question-resources/network9_minsp.png"], ["question-resources/network9_sp1.png", "/srv/numbas/media/question-resources/network9_sp1.png"], ["question-resources/network9_sp2.png", "/srv/numbas/media/question-resources/network9_sp2.png"], ["question-resources/network9_tree.png", "/srv/numbas/media/question-resources/network9_tree.png"], ["question-resources/network10_tr2_El8fNuV.png", "/srv/numbas/media/question-resources/network10_tr2_El8fNuV.png"]], "navigation": {"allowregen": true, "showfrontpage": false, "preventleave": false, "typeendtoleave": false}, "question_groups": [{"pickingStrategy": "all-ordered", "questions": [{"name": "Identify the minimum spanning tree", "tags": [], "metadata": {"description": "<p>Students are randomly shown one of two networks. They are shown four sub-networks, and asked to identify which one is a minimum spanning tree for the network. Thus, there are 2 versions of this question.</p>", "licence": "Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International"}, "statement": "<p>{image('resources/question-resources/'+imagelist[imagechoice])}</p>", "advice": "<p>You can either use Prim's algorithm or Kruskal's algorithm to find the minimum spanning tree for yourself.</p>\n<p>Or you can look through the options and discard those that are not spanning trees, then add up the weights in the remaining options, and choose the one with the least weight.</p>", "rulesets": {}, "extensions": [], "variables": {"imagelist": {"name": "imagelist", "group": "Ungrouped variables", "definition": "[\"network9.png\",\"network10.png\"]", "description": "", "templateType": "anything"}, "imagechoice": {"name": "imagechoice", "group": "Ungrouped variables", "definition": "random(0,1)", "description": "", "templateType": "anything"}, "optionlist": {"name": "optionlist", "group": "Ungrouped variables", "definition": "[\n  [\"network9_minsp.png\",\"network9_sp1.png\",\"network9_sp2.png\",\"network9_tree.png\"],\n  [\"network10_minsp.png\",\"network10_subnet.png\",\"network10_tr2_El8fNuV.png\",\"network10_spt1.png\"]\n]", "description": "", "templateType": "anything"}, "optiona": {"name": "optiona", "group": "Ungrouped variables", "definition": "optionlist[imagechoice][0]", "description": "", "templateType": "anything"}, "optionb": {"name": "optionb", "group": "Ungrouped variables", "definition": "optionlist[imagechoice][1]", "description": "", "templateType": "anything"}, "optionc": {"name": "optionc", "group": "Ungrouped variables", "definition": "optionlist[imagechoice][2]", "description": "", "templateType": "anything"}, "optiond": {"name": "optiond", "group": "Ungrouped variables", "definition": "optionlist[imagechoice][3]", "description": "", "templateType": "anything"}}, "variablesTest": {"condition": "", "maxRuns": 100}, "ungrouped_variables": ["imagelist", "imagechoice", "optionlist", "optiona", "optionb", "optionc", "optiond"], "variable_groups": [], "functions": {}, "preamble": {"js": "", "css": ""}, "parts": [{"type": "1_n_2", "useCustomName": false, "customName": "", "marks": 0, "scripts": {}, "customMarkingAlgorithm": "", "extendBaseMarkingAlgorithm": true, "unitTests": [], "showCorrectAnswer": true, "showFeedbackIcon": true, "variableReplacements": [], "variableReplacementStrategy": "originalfirst", "nextParts": [], "suggestGoingBack": false, "adaptiveMarkingPenalty": 0, "exploreObjective": null, "prompt": "<p>Which of the following is a minimum spanning tree for this network?</p>", "minMarks": 0, "maxMarks": 0, "shuffleChoices": true, "displayType": "radiogroup", "displayColumns": 0, "showCellAnswerState": true, "choices": ["{image('resources/question-resources/'+optiona)}", "{image('resources/question-resources/'+optionb)}", "{image('resources/question-resources/'+optionc)}", "{image('resources/question-resources/'+optiond)}"], "matrix": ["1", 0, 0, 0], "distractors": ["", "", "", ""]}], "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/"}]}