AQA D1 2006 January — Question 1

Exam BoardAQA
ModuleD1 (Decision Mathematics 1)
Year2006
SessionJanuary
TopicMatchings and Allocation
1
  1. Draw a bipartite graph representing the following adjacency matrix.
    (2 marks)
    \(\boldsymbol { U }\)\(V\)\(\boldsymbol { W }\)\(\boldsymbol { X }\)\(\boldsymbol { Y }\)\(\boldsymbol { Z }\)
    \(\boldsymbol { A }\)101010
    \(\boldsymbol { B }\)010100
    \(\boldsymbol { C }\)010001
    \(\boldsymbol { D }\)000100
    \(\boldsymbol { E }\)001011
    \(\boldsymbol { F }\)000110
  2. Given that initially \(A\) is matched to \(W , B\) is matched to \(X , C\) is matched to \(V\), and \(E\) is matched to \(Y\), use the alternating path algorithm, from this initial matching, to find a complete matching. List your complete matching.
This paper (9 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9