OCR FD1 AS 2018 March — Question 4 9 marks

Exam BoardOCR
ModuleFD1 AS (Further Decision 1 AS)
Year2018
SessionMarch
Marks9
TopicCritical Path Analysis
TypeEffect of activity delay/change
DifficultyModerate -0.8 This is a straightforward critical path analysis question requiring standard techniques: drawing an activity network, finding earliest/latest times, and analyzing simple changes to activity durations. Part (iv) requires minimal adaptation thinking. All steps are routine applications of the CPA algorithm with no novel problem-solving required.
Spec7.05a Critical path analysis: activity on arc networks7.05b Forward and backward pass: earliest/latest times, critical activities7.05c Total float: calculation and interpretation

4 Deva is having some work done on his house. The table shows the activities involved, their durations and their immediate predecessors.
ActivityImmediate predecessorsDuration (hours)
A Have skip delivered-3
B Remodel wallsA3
C Buy new fittings-2
D Fit electricsB2
E Fit plumbingB2
F Install fittingsC, E3
G PlasteringD,E2
H DecoratingF, G3
  1. Model this information as an activity network.
  2. Find the minimum time in which the work can be completed.
  3. Describe the effect on the minimum project completion time of each of the following happening individually.
    1. The duration of activity A is increased to 3.5 hours.
    2. The duration of activity D is increased to 4 hours.
    3. The duration of activity F is decreased to 2 hours. The decorators working on activity H cannot work for 3 hours without a break.
    4. How would you adapt your model to incorporate the break?

Question 4:
AnswerMarks Guidance
42 7
46 1
ActivityImmediate predecessors Duration (hours)
A Have skip delivered 3
B Remodel wallsA 3
C Buy new fittings 2
D Fit electricsB 2
E Fit plumbingB 2
F Install fittingsC, E 3
G PlasteringD,E 2
H DecoratingF, G 3
4
5 (i) How many arcs does the complete bipartite graph K have? [1]
5,5
A subgraph of K contains 5 arcs joining each of the elements of the set {1, 2, 3, 4, 5} to an element in a
5,5
permutation of the set {1, 2, 3, 4, 5}. Suppose that r is connected to p(r) for r = 1, 2, 3, 4, 5.
(ii) How many permutations would have p(1) ! 1? [2]
(iii) Using the pigeonhole principle, show that for every permutation of {1, 2, 3, 4, 5}, the product
P5 (r-p(r)) is even (i.e. an integer multiple of 2, including 0). [3]
r=1
(iv) Is the result in part (iii) true when the permutation is of the set {1, 2, 3, 4, 5, 6}?
Give a reason for your answer. [2]
6 An online magazine consists of an editorial, articles, reviews and advertisements.
The magazine must have a total of at least 12 pages. The editorial always takes up exactly half a page. There
must be at least 3 pages of articles and at most 1.5 pages of reviews. At least a quarter but fewer than half of
the pages in the magazine must be used for advertisements.
Let x be the number of pages used for articles, y be the number of pages used for reviews and z be the
number of pages used for advertisements.
The constraints on the values of x, y and z are:
x+y+z H 11.5
xH 3
yG 1.5
2x+2y-2z+1 H 0
2x+2y-6z+1 G 0
yH 0
(i) (a) Explain why x+y+z H 11.5. [1]
(b) Explain why only one non-negativity constraint is needed. [1]
(c) Show that the requirement that at least one quarter of the pages in the magazine must be used for
advertisements leads to the constraint 2x+2y-6z+1 G 0. [2]
Advertisements bring in money but are not popular with the subscribers. The editor decides to limit the
number of pages of advertisements to at most four.
(ii) Graph the feasible region in the case when z =4 using the axes in the Printed Answer Booklet. [5]
To be successful the magazine needs to maximise the number of subscribers.
The editor has found that when z G 4 the expected number of subscribers is given by P=300x+400y.
(iii) (a) What is the maximum expected number of subscribers when z =4? [2]
(b) By first considering the feasible region for z =k, where kG 4, find an expression for the
maximum number of subscribers in terms of k. [5]
END OF QUESTION PAPER
© OCR 2018 Practice paper Y534/01
8
Oxford Cambridge and RSA
Copyright Information
OCR is committed to seeking permission to reproduce all third-party content that it uses in its assessment materials. OCR has attempted to identify and contact all copyright holders
whose work is used in this paper. To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced in the OCR Copyright
Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download from our public website (www.ocr.org.uk) after the live examination series.
If OCR has unwittingly failed to correctly acknowledge or clear any third-party content in this assessment material, OCR will be happy to correct its mistake at the earliest possible
opportunity.
For queries or further information please contact the Copyright Team, First Floor, 9 Hills Road, Cambridge CB2 1GE.
OCR is part of the Cambridge Assessment Group; Cambridge Assessment is the brand name of University of Cambridge Local Examinations Syndicate (UCLES), which is itself a
department of the University of Cambridge.
© OCR 2018 Practice paper Y534/01
Question 4:
4 | 2 | 7
4 | 6 | 1
Activity | Immediate predecessors | Duration (hours)
A Have skip delivered | – | 3
B Remodel walls | A | 3
C Buy new fittings | – | 2
D Fit electrics | B | 2
E Fit plumbing | B | 2
F Install fittings | C, E | 3
G Plastering | D,E | 2
H Decorating | F, G | 3
4
5 (i) How many arcs does the complete bipartite graph K have? [1]
5,5
A subgraph of K contains 5 arcs joining each of the elements of the set {1, 2, 3, 4, 5} to an element in a
5,5
permutation of the set {1, 2, 3, 4, 5}. Suppose that r is connected to p(r) for r = 1, 2, 3, 4, 5.
(ii) How many permutations would have p(1) ! 1? [2]
(iii) Using the pigeonhole principle, show that for every permutation of {1, 2, 3, 4, 5}, the product
P5 (r-p(r)) is even (i.e. an integer multiple of 2, including 0). [3]
r=1
(iv) Is the result in part (iii) true when the permutation is of the set {1, 2, 3, 4, 5, 6}?
Give a reason for your answer. [2]
6 An online magazine consists of an editorial, articles, reviews and advertisements.
The magazine must have a total of at least 12 pages. The editorial always takes up exactly half a page. There
must be at least 3 pages of articles and at most 1.5 pages of reviews. At least a quarter but fewer than half of
the pages in the magazine must be used for advertisements.
Let x be the number of pages used for articles, y be the number of pages used for reviews and z be the
number of pages used for advertisements.
The constraints on the values of x, y and z are:
x+y+z H 11.5
xH 3
yG 1.5
2x+2y-2z+1 H 0
2x+2y-6z+1 G 0
yH 0
(i) (a) Explain why x+y+z H 11.5. [1]
(b) Explain why only one non-negativity constraint is needed. [1]
(c) Show that the requirement that at least one quarter of the pages in the magazine must be used for
advertisements leads to the constraint 2x+2y-6z+1 G 0. [2]
Advertisements bring in money but are not popular with the subscribers. The editor decides to limit the
number of pages of advertisements to at most four.
(ii) Graph the feasible region in the case when z =4 using the axes in the Printed Answer Booklet. [5]
To be successful the magazine needs to maximise the number of subscribers.
The editor has found that when z G 4 the expected number of subscribers is given by P=300x+400y.
(iii) (a) What is the maximum expected number of subscribers when z =4? [2]
(b) By first considering the feasible region for z =k, where kG 4, find an expression for the
maximum number of subscribers in terms of k. [5]
END OF QUESTION PAPER
© OCR 2018 Practice paper Y534/01
8
Oxford Cambridge and RSA
Copyright Information
OCR is committed to seeking permission to reproduce all third-party content that it uses in its assessment materials. OCR has attempted to identify and contact all copyright holders
whose work is used in this paper. To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced in the OCR Copyright
Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download from our public website (www.ocr.org.uk) after the live examination series.
If OCR has unwittingly failed to correctly acknowledge or clear any third-party content in this assessment material, OCR will be happy to correct its mistake at the earliest possible
opportunity.
For queries or further information please contact the Copyright Team, First Floor, 9 Hills Road, Cambridge CB2 1GE.
OCR is part of the Cambridge Assessment Group; Cambridge Assessment is the brand name of University of Cambridge Local Examinations Syndicate (UCLES), which is itself a
department of the University of Cambridge.
© OCR 2018 Practice paper Y534/01
4 Deva is having some work done on his house. The table shows the activities involved, their durations and their immediate predecessors.

\begin{center}
\begin{tabular}{|l|l|l|}
\hline
Activity & Immediate predecessors & Duration (hours) \\
\hline
A Have skip delivered & - & 3 \\
\hline
B Remodel walls & A & 3 \\
\hline
C Buy new fittings & - & 2 \\
\hline
D Fit electrics & B & 2 \\
\hline
E Fit plumbing & B & 2 \\
\hline
F Install fittings & C, E & 3 \\
\hline
G Plastering & D,E & 2 \\
\hline
H Decorating & F, G & 3 \\
\hline
\end{tabular}
\end{center}

(i) Model this information as an activity network.\\
(ii) Find the minimum time in which the work can be completed.\\
(iii) Describe the effect on the minimum project completion time of each of the following happening individually.
\begin{enumerate}[label=(\alph*)]
\item The duration of activity A is increased to 3.5 hours.
\item The duration of activity D is increased to 4 hours.
\item The duration of activity F is decreased to 2 hours.

The decorators working on activity H cannot work for 3 hours without a break.\\
(iv) How would you adapt your model to incorporate the break?
\end{enumerate}

\hfill \mbox{\textit{OCR FD1 AS 2018 Q4 [9]}}