| Date | November 2011 | Marks available | 2 | Reference code | 11N.3dm.hl.TZ0.1 |
| Level | HL only | Paper | Paper 3 Discrete mathematics | Time zone | TZ0 |
| Command term | Draw | Question number | 1 | Adapted from | N/A |
Question
The vertices of a graph L are A, B, C, D, E, F, G and H. The weights of the edges in L are given in the following table.
Draw the graph L.
Markscheme
A2
Note: Award A1 if one line missing or one line misplaced. Weights are not required.
[2 marks]
Examiners report
Most candidates were able to draw the graph as required in (a) and most made a meaningful start to applying Prim’s algorithm in (b). Candidates were not always clear about the order in which the edges were to be added.
Syllabus sections
Topic 10 - Option: Discrete mathematics » 10.7 » Simple graphs; connected graphs; complete graphs; bipartite graphs; planar graphs; trees; weighted graphs, including tabular representation.
Show 23 related questions
