identify the minimum spanning tree

Error

There was an error loading the page.

Contributors

Merryn Horrocks

Feedback

From users who are members of Standard Maths :

Merryn Horrocks

said

Ready to use

4 years, 5 months ago

History

○

Merryn Horrocks 4 years, 5 months ago

Published this.

○

Merryn Horrocks 4 years, 5 months ago

Gave some feedback: Ready to use

○

Merryn Horrocks 4 years, 5 months ago

Created this.

Name	Status	Author	Last Modified
identify the minimum spanning tree	Ready to use	Merryn Horrocks	03/01/2023 06:06
Identify the minimum spanning tree	draft	Stephen Maher	26/11/2020 11:26

There are 2 other versions that do you not have access to.

Question statement

{image('resources/question-resources/'+imagelist[imagechoice])}

Give any introductory information the student needs.

			Name	Type	Generated Value

imagelist	list	List of 2 items
imagechoice	integer	1
optionlist	list	Nested 2×4 list
optiona	string	network10_minsp.png
optionb	string	network10_subnet.png
optionc	string	network10_tr2_El8fNuV.png
optiond	string	network10_spt1.png

Automatically regenerate variables?

Name

Data type

Value

xxxxxxxxxx
 
["network9.png","network10.png"]

JME function reference

Description

Describe what this variable represents, and list any assumptions made about its value.

Can an exam override the value of this variable?

Generated value: `list`

[ "network9.png", "network10.png" ]

This variable doesn't seem to be used anywhere.

Parts

Choose one from a list

Choose one from a list

Ask the student a question, and give any hints about how they should answer this part.

Which of the following is a minimum spanning tree for this network?

Show choice feedback state?

Show correct answer on reveal?

Show score feedback icon?

Advanced settings

Selection type

Number of display columns

(not displayed in columns)

Custom marking matrix?

{image('resources/question-resources/'+optiona)}

Marks: Distractor Message:
{image('resources/question-resources/'+optionb)}

Marks: Distractor Message:
{image('resources/question-resources/'+optionc)}

Marks: Distractor Message:
{image('resources/question-resources/'+optiond)}

Marks: Distractor Message:

Advice

You can either use Prim's algorithm or Kruskal's algorithm to find the minimum spanning tree for yourself.

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.

Give a worked solution to the whole question.