OCR MEI D1 2008 January — Question 1 3 marks

Exam BoardOCR MEI
ModuleD1 (Decision Mathematics 1)
Year2008
SessionJanuary
Marks3
TopicPermutations & Arrangements
TypeAssignment/allocation matching problems

1 The graph shows routes that are available to an international lorry driver. The solid arcs represent motorways and the broken arcs represent ferry crossings.
\includegraphics[max width=\textwidth, alt={}, center]{dfe6db33-33d0-4dff-95f7-fbf097e3963e-2_668_1131_587_466}
  1. Give a route from Milan to Chania involving exactly two ferry crossings. How many such routes are there?
  2. Give a route from Milan to Chania involving exactly three ferry crossings. How many such routes are there?
  3. Give a route from Milan to Chania using as many ferry crossings as possible, without repeating any arc.
    [0pt]
  4. Give a route leaving Piraeus and finishing elsewhere which uses every arc once and only once.[3]