Questions FD2 AS (32 questions)

Browse by board
AQA AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Paper 1 Further Paper 2 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics M1 M2 M3 Paper 1 Paper 2 Paper 3 S1 S2 S3 CAIE FP1 FP2 Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 4 M1 M2 P1 P2 P3 S1 S2 Edexcel AEA AS Paper 1 AS Paper 2 C1 C12 C2 C3 C34 C4 CP AS CP1 CP2 D1 D2 F1 F2 F3 FD1 FD1 AS FD2 FD2 AS FM1 FM1 AS FM2 FM2 AS FP1 FP1 AS FP2 FP2 AS FP3 FS1 FS1 AS FS2 FS2 AS M1 M2 M3 M4 M5 P1 P2 P3 P4 PMT Mocks Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 OCR AS Pure C1 C2 C3 C4 D1 D2 FD1 AS FM1 AS FP1 FP1 AS FP2 FP3 FS1 AS Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Mechanics Further Mechanics AS Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Statistics Further Statistics AS H240/01 H240/02 H240/03 M1 M2 M3 M4 Mechanics 1 PURE Pure 1 S1 S2 S3 S4 Stats 1 OCR MEI AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further Extra Pure Further Mechanics A AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Pure Core Further Pure Core AS Further Pure with Technology Further Statistics A AS Further Statistics B AS Further Statistics Major Further Statistics Minor M1 M2 M3 M4 Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 SPS SPS ASFM SPS ASFM Mechanics SPS ASFM Pure SPS ASFM Statistics SPS FM SPS FM Mechanics SPS FM Pure SPS FM Statistics SPS SM SPS SM Mechanics SPS SM Pure SPS SM Statistics WJEC Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 Unit 1 Unit 2 Unit 3 Unit 4
Edexcel FD2 AS 2024 June Q2
2. A team of 5 players, A, B, C, D and E, competes in a quiz. Each player must answer one of 5 rounds, \(\mathrm { P } , \mathrm { Q } , \mathrm { R } , \mathrm { S }\) and T . Each player must be assigned to exactly one round, and each round must be answered by exactly one player. Player B cannot answer round Q, player D cannot answer round T, and player E cannot answer round R. The number of points that each player is expected to earn in each round is shown in the table.
\cline { 2 - 6 } \multicolumn{1}{c|}{}\(\mathbf { P }\)\(\mathbf { Q }\)\(\mathbf { R }\)\(\mathbf { S }\)\(\mathbf { T }\)
\(\mathbf { A }\)3240354137
\(\mathbf { B }\)38-402733
\(\mathbf { C }\)4128373635
\(\mathbf { D }\)35333836-
\(\mathbf { E }\)4038-3934
The team wants to maximise its total expected score.
The Hungarian algorithm is to be used to find the maximum total expected score that can be earned by the 5 players.
  1. Explain how the table should be modified.
    1. Reducing rows first, use the Hungarian algorithm to obtain an allocation which maximises the total expected score.
    2. Calculate the maximum total expected score.
Edexcel FD2 AS 2024 June Q3
3. Haruki and Meera play a zero-sum game. The game is represented by the following pay-off matrix for Haruki.
\multirow{2}{*}{}Meera
Option XOption YOption Z
\multirow{4}{*}{Haruki}Option A4-2-5
Option B14-3
Option C-161
Option D-453
  1. Determine whether the game has a stable solution. Option Y for Meera is now removed.
  2. Write down the reduced pay-off matrix for Meera.
    1. Given that Meera plays Option X with probability \(p\), determine her best strategy.
    2. State the value of the game to Haruki.
    3. State which option(s) Haruki should never play. The number of points scored by Haruki when he plays Option C and Meera plays Option X changes from - 1 to \(k\) Given that the value of the game is now the same for both players,
  3. determine the value of \(k\). You must make your method and working clear.
Edexcel FD2 AS 2024 June Q4
4. Peter sets up a savings plan. He makes an initial deposit of \(\pounds D\) and then pays in \(\pounds M\) at the end of each month. The value of the savings plan, in pounds, is modelled by $$u _ { n + 1 } = 1.025 u _ { n } + 1800$$ where \(n \geqslant 0\) is an integer and \(u _ { n }\) is the total value of the savings plan, in pounds, after \(n\) years.
  1. Calculate the value of \(M\) Given that the value of the savings plan after 1 year is \(\pounds 6925\)
  2. solve the recurrence relation for \(u _ { n }\)
  3. Determine the value of \(D\)
  4. Hence determine, using algebra, the number of years it will take for the value of the savings plan to exceed \(\pounds 20000\)
Edexcel FD2 AS Specimen Q1
  1. Six workers, A, B, C, D, E and F, are to be assigned to five tasks, P, Q, R, S and T.
Each worker can be assigned to at most one task and each task must be done by just one worker. The time, in minutes, that each worker takes to complete each task is shown in the table below.
PQRST
A3232353433
B2835313740
C3529333635
D3630343335
E3031293736
F2928323134
Reducing rows first, use the Hungarian algorithm to obtain an allocation which minimises the total time. You must explain your method and show the table after each stage.
Edexcel FD2 AS Specimen Q2
2. In two-dimensional space, lines divide a plane into a number of different regions. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{81510c1c-89ce-4fa8-aa1b-3c8b255804cc-3_421_328_306_278} \captionsetup{labelformat=empty} \caption{Figure 1}
\end{figure} \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{81510c1c-89ce-4fa8-aa1b-3c8b255804cc-3_423_330_306_671} \captionsetup{labelformat=empty} \caption{Figure 2}
\end{figure} \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{81510c1c-89ce-4fa8-aa1b-3c8b255804cc-3_426_330_303_1065} \captionsetup{labelformat=empty} \caption{Figure 3}
\end{figure} \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{81510c1c-89ce-4fa8-aa1b-3c8b255804cc-3_423_332_306_1457} \captionsetup{labelformat=empty} \caption{Figure 4}
\end{figure} It is known that:
  • One line divides a plane into 2 regions, as shown in Figure 1
  • Two lines divide a plane into a maximum of 4 regions, as shown in Figure 2
  • Three lines divide a plane into a maximum of 7 regions, as shown in Figure 3
  • Four lines divide a plane into a maximum of 11 regions, as shown in Figure 4
    1. Complete the table in the answer book to show the maximum number of regions when five, six and seven lines divide a plane.
    2. Find, in terms of \(\mathrm { u } _ { \mathrm { n } }\), the recurrence relation for \(\mathrm { u } _ { \mathrm { n } + 1 }\), the maximum number of regions when a plane is divided by ( \(n + 1\) ) lines where \(n \geqslant 1\)
      1. Solve the recurrence relation for \(u _ { n }\)
      2. Hence determine the maximum number of regions created when 200 lines divide a plane.
Edexcel FD2 AS Specimen Q3
3.
\includegraphics[max width=\textwidth, alt={}]{81510c1c-89ce-4fa8-aa1b-3c8b255804cc-4_2255_54_315_34}
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{81510c1c-89ce-4fa8-aa1b-3c8b255804cc-4_913_1783_287_139} \captionsetup{labelformat=empty} \caption{Figure 5}
\end{figure} Figure 5 represents a network of corridors in a school. The number on each arc represents the maximum number of students, per minute, that may pass along each corridor at any one time. At 11 am on Friday morning, all students leave the hall (S) after assembly and travel to the cybercafé ( T ). The numbers in circles represent the initial flow of students recorded at 11 am one Friday.
  1. State an assumption that has been made about the corridors in order for this situation to be modelled by a directed network.
  2. Find the value of x and the value of y , explaining your reasoning. Five new students also attend the assembly in the hall the following Friday. They too need to travel to the cybercafé at 11 am . They wish to travel together so that they do not get lost. You may assume that the initial flow of students through the network is the same as that shown in Figure 5 above.
    1. List all the flow augmenting routes from S to T that increase the flow by at least 5
    2. State which route the new students should take, giving a reason for your answer.
  3. Use the answer to part (c) to find a maximum flow pattern for this network and draw it on Diagram 1 in the answer book.
  4. Prove that the answer to part (d) is optimal. The school is intending to increase the number of students it takes but has been informed it cannot do so until it improves the flow of students at peak times. The school can widen corridors to increase their capacity, but can only afford to widen one corridor in the coming term.
  5. State, explaining your reasoning,
    1. which corridor they should widen,
    2. the resulting increase of flow through the network.
Edexcel FD2 AS Specimen Q4
4. A two person zero-sum game is represented by the following pay-off matrix for player A.
\cline { 2 - 4 } \multicolumn{1}{c|}{}B plays 1B plays 2B plays 3
A plays 1412
A plays 2243
  1. Verify that there is no stable solution.
    1. Find the best strategy for player A.
    2. Find the value of the game to her.