| Exam Board | OCR MEI |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Year | 2010 |
| Session | June |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Shortest Path |
| Type | Floyd's algorithm application |
| Difficulty | Moderate -0.5 This is a straightforward application of Floyd's algorithm, a standard D2 topic. The question appears to show a single row from a distance matrix, requiring mechanical execution of the algorithm's iterative updates. While it requires careful bookkeeping, it involves no problem-solving or insight beyond following the prescribed procedure, making it easier than average. |
I don't see a clear mark scheme structure in the content provided. The data appears to be numerical tables without marking annotations (M1, A1, B1, etc.), question text, or guidance notes.
Could you please provide the actual mark scheme content that includes:
- The question text
- Marking points with annotations (M1, A1, B1, DM1, etc.)
- Expected answers or solution steps
- Any guidance or notes for markers
Once you provide the properly formatted mark scheme, I'll be able to clean it up and convert unicode symbols to LaTeX notation as requested.$\mathbf { 5 }$ & 7 & 6 & $\infty$ & 10 & 14 & 8 \\
\hline
\hfill \mbox{\textit{OCR MEI D2 2010 Q5}}