Maths

Question 1

What do you do for scale questions when it asks for an area?

Answer 1

Multiply the answer by the scale factor 2x

Question 2

What is Kruskal’s method?

Answer 2

First, find the edge with the least weight & connect the path however way you like - it doesn’t have to all join from the starting point, it just has to reach each edge in the end

Question 3

What is a Eulerian trail?

Answer 3

Network must have 0 or 2 vertices of odd degree

Question 4

What is a Eulerian Circuit?

Question 5

What is the handshake lemma

Answer 5

The sum of all degrees in network = 2x number of edges in network