OCR Further Discrete 2019 June — Question 2

Exam BoardOCR
ModuleFurther Discrete (Further Discrete)
Year2019
SessionJune
TopicPermutations & Arrangements
TypeAssignment/allocation matching problems

2 A project is represented by the activity network and cascade chart below. The table showing the number of workers needed for each activity is incomplete. Each activity needs at least 1 worker.
\includegraphics[max width=\textwidth, alt={}, center]{7717b4ca-45ab-4111-9f59-5a3abb04b388-2_202_565_1605_201}
\includegraphics[max width=\textwidth, alt={}, center]{7717b4ca-45ab-4111-9f59-5a3abb04b388-2_328_560_1548_820}
ActivityWorkers
A2
BX
C
D
E
F
  1. Complete the table in the Printed Answer Booklet to show the immediate predecessors for each activity.
  2. Calculate the latest start time for each non-critical activity. The minimum number of workers needed is 5 .
  3. What type of problem (existence, construction, enumeration or optimisation) is the allocation of a number of workers to the activities? There are 8 workers available who can do activities A and B .
    1. Find the number of ways that the workers for activity A can be chosen.
    2. When the workers have been chosen for activity A , find the total number of ways of choosing the workers for activity B for all the different possible values of x , where \(\mathrm { x } \geqslant 1\).