OCR D1 2010 January — Question 6

Exam BoardOCR
ModuleD1 (Decision Mathematics 1)
Year2010
SessionJanuary
TopicCombinations & Selection
6
  1. Greatest number of arcs
    for a network with five vertices \(=\) \(\_\_\_\_\)
    for a network with \(n\) vertices \(=\) \(\_\_\_\_\)
  2. (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 = \(\_\_\_\_\)
  3. M1
    Vertices in tree
    M2
    Arcs in tree
    M3
    Vertices not in tree
    A B C D E
    DE
    D
    2
    \(E\)
    		\(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\)
  4. \(\_\_\_\_\)
This paper (6 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6