Back to the full dot-point answer
Northern IrelandFurther MathsQuick questions
A2 2 Applied Mathematics
Quick questions on Discrete and decision mathematics: graphs, spanning trees, shortest paths and algorithms - CCEA A-Level Further Maths
4short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.
What is minimum spanning tree?Show answer
Both give the same minimum total weight; Prim builds one connected piece throughout, while Kruskal may build several fragments that join up.
What is q1?Show answer
What is a spanning tree of a network? [1 mark]
What is q2?Show answer
Which algorithm is edge-based and sorts edges by weight? [1 mark]
What is q3?Show answer
In Dijkstra's algorithm, what does the final permanent label of the destination represent? [1 mark]
Have a question we have not covered?
This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.