No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

No description given

Given a regular n-gon, students are asked for the sum of external angles, sum of internal angles, and the values of the external and internal angles.

Given n-1 angles inside a polygon, students have to calculate the value of the last internal angle.

Students are shown 4 exponential equations, and 4 graphs and asked to match them.

Students explore the relationship between length and area of a rectangle.

The perimeter of the rectangle is randomised. Students are given 11 different lengths, and asked to compute rectangle width and area for each. They are then asked to graph the function, identify it as a parabola, and estimate the maximum value.

Students are asked to find either the initial production cost, or a gradient, or the break even point from a graph.
They are then asked to determine the profit or loss from the graph for the production of a particular number of units. This number is randomised.

Students are shown 4 network diagrams (randomly selected from a pool of 20) and asked to identify which of them are trees.

Students are awarded 1 mark for each correct identification, and lose 1 mark for each non-tree they select.

As the number of trees can change, the number of marks that this question is worth can also change, ranging from 1 to 4.

Students are shown a graph with 6 vertices and asked to find the length of the shortest path from A to a random vertex.

There is only one graph, but all of the weights are randomised.

They can find the length any way they wish. In the advice, the steps of Dijkstra's algorithm used in solving this problem are displayed. It is not a complete worked solution but it should be sufficient to figure out the shortest path used to reach each vertex.

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.

Students are randomly shown one of 3 networks.

They are given 4 sub-networks and asked to identify which one is a spanning tree

Students are shown one of a disconnected graph, a tree, and a graph containing cycles. They are asked the yes/no question: "Is this a connected graph?"

This question displays one of 6 graphs and asks the yes/no question, "Does this graph contain a cycle"?