| Exam Board | OCR |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2010 |
| Session | January |
| Marks | 13 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Minimum Spanning Trees |
| Type | State number of edges formula |
| Difficulty | Easy -1.8 This is a straightforward recall question testing basic formulas from Decision Mathematics: maximum arcs in a complete graph (n(n-1)/2), bubble sort passes and comparisons, and applying Prim's/Kruskal's algorithm. All parts require only direct application of standard D1 formulas and algorithms with no problem-solving or insight needed. |
| Spec | 7.02a Graphs: vertices (nodes) and arcs (edges)7.04b Minimum spanning tree: Prim's and Kruskal's algorithms |
|
|
| ||||||||
| A B C D E | ||||||||||
| DE |
| \(A B C\) | ||||||||
| \includegraphics[max width=\textwidth, alt={}]{e1495f6b-c09f-46a1-a6f8-02354e28887a-11_109_220_1879_786} | ||||||||||
| \includegraphics[max width=\textwidth, alt={}]{e1495f6b-c09f-46a1-a6f8-02354e28887a-11_163_220_2005_786} | ||||||||||
| \multirow{3}{*}{} | ||||||||||
| \includegraphics[max width=\textwidth, alt={}]{e1495f6b-c09f-46a1-a6f8-02354e28887a-11_231_220_2174_786} | ||||||||||
| \(\boldsymbol { M 4 }\) | |
| Sorted list | |
| \(D\) | 2 | \(E\) |
| \(A\) | 3 | \(E\) |
| \(A\) | 4 | \(C\) |
| \(C\) | 5 | \(D\) |
| \(B\) | 6 | \(E\) |
| \(B\) | 7 | \(C\) |
| \(A\) | 8 | \(B\) |
| \(C\) | 9 | \(E\) |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Five vertices: maximum arcs \(= \frac{1}{2}(5)(4) = 10\) | B1 | |
| \(n\) vertices: maximum arcs \(= \frac{1}{2}n(n-1)\) | B1 |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Maximum number of passes \(= 9\) (i.e. \(\frac{1}{2}n(n-1)-1\) passes for \(n=5\)) | B1 | |
| Comparisons in pass 1: 9, pass 2: 8, pass 3: 7 | B1 | |
| Maximum total comparisons \(= 9+8+\ldots+1 = 45 - \frac{1}{2}(1)(2)\)... \(=\frac{1}{2}(9)(10)=45\) | B1 |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Number of arcs \(= \frac{1}{2}n(n-1)\), so number of passes \(= \frac{1}{2}n(n-1)-1\) | M1 | |
| Total comparisons \(= \sum_{k=1}^{\frac{1}{2}n(n-1)-1} k = \frac{1}{2}\left(\frac{1}{2}n(n-1)-1\right)\left(\frac{1}{2}n(n-1)\right) = \frac{1}{4}n(n-1)\left(\frac{1}{2}n(n-1)-1\right)\) | A1 | Using given summation formula |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Correct completion of table showing \(M1\), \(M2\), \(M3\), \(M4\) at each stage of Kruskal's on given network | M1 A1 A1 A1 | One mark per correct stage |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \(\frac{500^4}{100^4} = 5^4 = 625\) | M1 | |
| \(625 \times 30 = 18750\) seconds | A1 |
# Question 6:
## Part (i)
| Answer | Marks | Guidance |
|--------|-------|----------|
| Five vertices: maximum arcs $= \frac{1}{2}(5)(4) = 10$ | B1 | |
| $n$ vertices: maximum arcs $= \frac{1}{2}n(n-1)$ | B1 | |
## Part (ii)(a)
| Answer | Marks | Guidance |
|--------|-------|----------|
| Maximum number of passes $= 9$ (i.e. $\frac{1}{2}n(n-1)-1$ passes for $n=5$) | B1 | |
| Comparisons in pass 1: 9, pass 2: 8, pass 3: 7 | B1 | |
| Maximum total comparisons $= 9+8+\ldots+1 = 45 - \frac{1}{2}(1)(2)$... $=\frac{1}{2}(9)(10)=45$ | B1 | |
## Part (ii)(b)
| Answer | Marks | Guidance |
|--------|-------|----------|
| Number of arcs $= \frac{1}{2}n(n-1)$, so number of passes $= \frac{1}{2}n(n-1)-1$ | M1 | |
| Total comparisons $= \sum_{k=1}^{\frac{1}{2}n(n-1)-1} k = \frac{1}{2}\left(\frac{1}{2}n(n-1)-1\right)\left(\frac{1}{2}n(n-1)\right) = \frac{1}{4}n(n-1)\left(\frac{1}{2}n(n-1)-1\right)$ | A1 | Using given summation formula |
## Part (iii)
| Answer | Marks | Guidance |
|--------|-------|----------|
| Correct completion of table showing $M1$, $M2$, $M3$, $M4$ at each stage of Kruskal's on given network | M1 A1 A1 A1 | One mark per correct stage |
## Part (iv)
| Answer | Marks | Guidance |
|--------|-------|----------|
| $\frac{500^4}{100^4} = 5^4 = 625$ | M1 | |
| $625 \times 30 = 18750$ seconds | A1 | |
I can see this is an OCR Decision Mathematics 1 (4736) insert paper from January 2010, but the images shown are the **question insert pages**, not the mark scheme. The pages contain:
- The candidate instruction cover sheet
- Question 1 answer spaces (Dijkstra's algorithm network)
- Question 6 answer spaces (covering bubble sort / Kruskal's algorithm)
- Two blank pages
**No mark scheme content is visible in these images.** The mark scheme would be a separate document.
If you have images of the actual mark scheme document, please share those and I can extract the content you need in the format requested.
The image you've shared appears to be essentially blank (page 4) with only the OCR copyright information at the bottom. There is no mark scheme content visible on this page to extract.
Could you please share the actual pages containing the mark scheme questions and answers? This appears to be either a blank page or the back cover of the document.
6
\begin{enumerate}[label=(\roman*)]
\item Greatest number of arcs\\
for a network with five vertices $=$ $\_\_\_\_$\\
for a network with $n$ vertices $=$ $\_\_\_\_$
\item (a) For a network with five vertices\\
maximum number of passes $=$ $\_\_\_\_$\\
maximum number of comparisons\\
in the first pass $=$ $\_\_\_\_$\\
in the second pass = $\_\_\_\_$\\
in the third pass = $\_\_\_\_$\\
maximum total number of comparisons = $\_\_\_\_$\\
(b) For a network with $n$ vertices\\
maximum total number of comparisons = $\_\_\_\_$
\item \begin{center}
\begin{tabular}{|l|l|l|l|l|}
\hline
\begin{tabular}{l}
M1 \\
Vertices in tree \\
\end{tabular} & \multicolumn{3}{|c|}{\begin{tabular}{l}
M2 \\
Arcs in tree \\
\end{tabular}} & \begin{tabular}{l}
M3 \\
Vertices not in tree \\
\end{tabular} \\
\hline
& & & & A B C D E \\
\hline
DE & \multicolumn{3}{|c|}{\begin{tabular}{l}
D \\
2 \\
$E$ \\
\end{tabular}} & $A B C$ \\
\hline
& \includegraphics[max width=\textwidth, alt={}]{e1495f6b-c09f-46a1-a6f8-02354e28887a-11_109_220_1879_786}
& & & \\
\hline
& \includegraphics[max width=\textwidth, alt={}]{e1495f6b-c09f-46a1-a6f8-02354e28887a-11_163_220_2005_786}
& & & \\
\hline
& & & & \multirow{3}{*}{} \\
\hline
& & & & \\
\hline
& \includegraphics[max width=\textwidth, alt={}]{e1495f6b-c09f-46a1-a6f8-02354e28887a-11_231_220_2174_786}
& & & \\
\hline
\end{tabular}
\end{center}
\begin{center}
\begin{tabular}{ | c | c | c | }
\hline
\multicolumn{2}{|c|}{$\boldsymbol { M 4 }$} \\
Sorted list & \\
\end{tabular}
\end{center}$|$\begin{tabular}{ | c | c | c | }
\hline
\multicolumn{3}{|c|}{} \\
\hline
$D$ & 2 & $E$ \\
\hline
$A$ & 3 & $E$ \\
\hline\hline
$A$ & 4 & $C$ \\
\hline\hline
$C$ & 5 & $D$ \\
\hline\hline
$B$ & 6 & $E$ \\
\hline\hline
$B$ & 7 & $C$ \\
\hline\hline
$A$ & 8 & $B$ \\
\hline\hline
$C$ & 9 & $E$ \\
\hline
\end{tabular}
\item $\_\_\_\_$
\end{enumerate}
\hfill \mbox{\textit{OCR D1 2010 Q6 [13]}}