Compare Prim's and Kruskal's algorithms

A question is this type if and only if it asks you to state differences between Prim's algorithm and Kruskal's algorithm.

3 questions · Moderate -0.8

7.04b Minimum spanning tree: Prim's and Kruskal's algorithms
Sort by: Default | Easiest first | Hardest first
Edexcel D1 2014 June Q4
13 marks Moderate -0.8
4.
  1. State three differences between Prim's algorithm and Kruskal's algorithm for finding a minimum spanning tree.
    (3) \begin{figure}[h]
    \includegraphics[alt={},max width=\textwidth]{4609ffb5-d270-4ff3-aa44-af8442a38b66-5_864_1073_386_497} \captionsetup{labelformat=empty} \caption{Figure 4}
    \end{figure} [The total weight of the network is 341]
  2. Use Prim's algorithm, starting at D , to find a minimum spanning tree for the network shown in Figure 4. You must list the arcs in the order in which you select them.
    (3) Figure 4 models a network of school corridors. The number on each arc represents the length, in metres, of that corridor. The school caretaker needs to inspect each corridor in the school to check that the fire alarms are working correctly. He wants to find a route of minimum length that traverses each corridor at least once and starts and finishes at his office, D.
  3. Use the route inspection algorithm to find the corridors that will need to be traversed twice. You must make your method and working clear. The caretaker now decides to start his inspection at G. His route must still traverse each corridor at least once but he does not need to finish at G.
  4. Determine the finishing point so that the length of his route is minimised. You must give reasons for your answer and state the length of his route.
    (3)
Edexcel D1 2008 June Q4
8 marks Moderate -0.8
4. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{be646775-535e-4105-86b4-ffc7eda4fa51-4_653_1257_248_404} \captionsetup{labelformat=empty} \caption{Figure 4}
\end{figure}
  1. State two differences between Kruskal's algorithm and Prim's algorithm for finding a minimum spanning tree.
    (2)
  2. Listing the arcs in the order that you consider them, find a minimum spanning tree for the network in Figure 4, using
    1. Prim's algorithm,
    2. Kruskal's algorithm.
      (6)
Edexcel D1 2013 June Q2
8 marks Moderate -0.8
2.
ABCDEF
A-85110160225195
B85-100135180150
C110100-215200165
D160135215-235215
E225180200235-140
F195150165215140-
The table shows the average journey time, in minutes, between six towns, \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E }\) and F .
  1. Use Prim's algorithm, starting at A , to find a minimum spanning tree for this network. You must list the arcs that form your tree in the order in which you selected them.
  2. Draw your tree using the vertices given in Diagram 1 in the answer book.
  3. Find the weight of your minimum spanning tree. Kruskal's algorithm may also be used to find a minimum spanning tree.
  4. State three differences between Prim's algorithm and Kruskal's algorithm.