Questions Further Paper 3 Discrete (60 questions)

Browse by module
All questions AEA AS Paper 1 AS Paper 2 AS Pure 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 Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Extra Pure Further Mechanics Further Mechanics A AS Further Mechanics AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics Further Paper 4 Further Pure Core Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Pure with Technology Further Statistics Further Statistics A AS Further Statistics AS Further Statistics B AS Further Statistics Major Further Statistics Minor Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 H240/01 H240/02 H240/03 M1 M2 M3 M4 M5 P1 P2 P3 P4 PMT Mocks PURE Paper 1 Paper 2 Paper 3 Pre-U 9794/1 Pre-U 9794/2 Pre-U 9794/3 Pre-U 9795 Pre-U 9795/1 Pre-U 9795/2 S1 S2 S3 S4 Unit 1 Unit 2 Unit 3 Unit 4
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 PURE 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 PURE S1 S2 S3 S4 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 Pre-U Pre-U 9794/1 Pre-U 9794/2 Pre-U 9794/3 Pre-U 9795 Pre-U 9795/1 Pre-U 9795/2 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
Sort by: Default | Easiest first | Hardest first
AQA Further Paper 3 Discrete 2024 June Q1
1 marks Moderate -0.5
Which one of the following sets forms a group under the given binary operation? Tick \((\checkmark)\) one box. [1 mark]
SetBinary Operation
\(\{1, 2, 3\}\)Addition modulo 4\(\square\)
\(\{1, 2, 3\}\)Multiplication modulo 4\(\square\)
\(\{0, 1, 2, 3\}\)Addition modulo 4\(\square\)
\(\{0, 1, 2, 3\}\)Multiplication modulo 4\(\square\)
AQA Further Paper 3 Discrete 2024 June Q2
1 marks Easy -2.0
A student is trying to find the solution to the travelling salesperson problem for a network. They correctly find two lower bounds for the solution: 15 and 19 They also correctly find two upper bounds for the solution: 48 and 51 Based on the above information only, which of the following pairs give the best lower bound and best upper bound for the solution of this problem? Tick \((\checkmark)\) one box. [1 mark]
Best Lower BoundBest Upper Bound
1548\(\square\)
1551\(\square\)
1948\(\square\)
1951\(\square\)
AQA Further Paper 3 Discrete 2024 June Q3
1 marks Moderate -0.8
The simple-connected graph \(G\) has the adjacency matrix $$\begin{array}{c|cccc} & A & B & C & D \\ \hline A & 0 & 1 & 1 & 1 \\ B & 1 & 0 & 1 & 0 \\ C & 1 & 1 & 0 & 1 \\ D & 1 & 0 & 1 & 0 \\ \end{array}$$ Which one of the following statements about \(G\) is true? Tick \((\checkmark)\) one box. [1 mark] \(G\) is a tree \(\square\) \(G\) is complete \(\square\) \(G\) is Eulerian \(\square\) \(G\) is planar \(\square\)
AQA Further Paper 3 Discrete 2024 June Q4
4 marks Standard +0.8
Daniel and Jackson play a zero-sum game. The game is represented by the following pay-off matrix for Daniel. Jackson
StrategyWXYZ
\multirow{4}{*}{Daniel}A3\(-2\)14
B51\(-4\)1
C2\(-1\)12
D\(-3\)02\(-1\)
Neither player has any strategies which can be ignored due to dominance.
  1. Prove that the game does not have a stable solution. Fully justify your answer. [3 marks]
  2. Determine the play-safe strategy for each player. [1 mark] Play-safe strategy for Daniel _______________________________________________ Play-safe strategy for Jackson ______________________________________________
AQA Further Paper 3 Discrete 2024 June Q5
4 marks Moderate -0.8
The owners of a sports stadium want to install electric car charging points in each of the stadium's nine car parks. An engineer creates a plan which requires installing electrical connections so that each car park is connected, directly or indirectly, to the stadium's main electricity power supply. The engineer produces the network shown below, where the nodes represent the stadium's main electricity power supply \(X\) and the nine car parks \(A\), \(B\), \(\ldots\), \(I\) \includegraphics{figure_5} Each arc represents a possible electrical connection which could be installed. The weight on each arc represents the time, in hours, it would take to install the electrical connection. The electrical connections can only be installed one at a time. To reduce disruption, the owners of the sports stadium want the required electrical connections to be installed in the minimum possible total time.
    1. Determine the electrical connections that should be installed. [2 marks]
    2. Find the minimum possible total time needed to install the required electrical connections. [1 mark]
  2. Following the installation of the electrical connections, some of the car parks have an indirect connection to the stadium's main electricity power supply. Give one limitation of this installation. [1 mark]
AQA Further Paper 3 Discrete 2024 June Q6
6 marks Standard +0.8
A company delivers parcels to houses in a village, using a van. The network below shows the roads in the village. Each node represents a road junction and the weight of each arc represents the length, in miles, of the road between the junctions. \includegraphics{figure_6} The total length of all of the roads in the village is 31.4 miles. On one particular day, the driver is due to make deliveries to at least one house on each road, so the van must travel along each road at least once. However, the driver has forgotten to add fuel to the van and it only has 4.5 litres of fuel to use to make its deliveries. The van uses, on average, 1 litre of fuel to travel 7.8 miles along the roads of this village. Whilst making each delivery, the driver turns off the van's engine so it does not use any fuel. Determine whether the van has enough fuel for the driver to make all of the deliveries to houses on each road of the village, starting and finishing at the same junction. Fully justify your answer. [6 marks]
AQA Further Paper 3 Discrete 2024 June Q7
12 marks Standard +0.3
  1. By considering associativity, show that the set of integers does not form a group under the binary operation of subtraction. Fully justify your answer. [2 marks]
  2. The group \(G\) is formed by the set $$\{1, 7, 8, 11, 12, 18\}$$ under the operation of multiplication modulo 19
    1. Complete the Cayley table for \(G\) [3 marks]
      \(\times_{19}\)178111218
      1178111218
      7711
      887
      11117
      121211
      18181
    2. State the inverse of 11 in \(G\) [1 mark]
    1. State, with a reason, the possible orders of the proper subgroups of \(G\) [2 marks]
    2. Find all the proper subgroups of \(G\) Give your answers in the form \(\langle g \rangle, \times_{19}\) where \(g \in G\) [3 marks]
    3. The group \(H\) is such that \(G \cong H\) State a possible name for \(H\) [1 mark]
AQA Further Paper 3 Discrete 2024 June Q8
8 marks Standard +0.8
Figure 1 shows a network of water pipes. The number on each arc represents the upper capacity for each pipe in litres per second. The numbers in the circles represent an initial feasible flow of 103 litres per second. \includegraphics{figure_1}
  1. On Figure 1 above, add a supersource \(S\) and a supersink \(T\) to the network. [2 marks]
  2. Using flow augmentation, find the maximum flow through the network. You must indicate any flow augmenting paths clearly in the table below. You may use Figure 2, on the opposite page, in your solution. [4 marks]
    Augmenting PathExtra Flow
    Maximum Flow ______________ litres per second
  3. While the flow through the network is at its maximum value, the pipe \(EG\) develops a leak. To repair the leak, an engineer turns off the flow of water through \(EG\) The engineer claims that the maximum flow of water through the network will reduce by 31 litres per second. Comment on the validity of the engineer's claim. [2 marks]
AQA Further Paper 3 Discrete 2024 June Q9
6 marks Challenging +1.2
Janet and Samantha play a zero-sum game. The game is represented by the following pay-off matrix for Janet. Samantha
Strategy\(S_1\)\(S_2\)\(S_3\)
\multirow{4}{*}{Janet}\(J_1\)276
\(J_2\)551
\(J_3\)438
\(J_4\)164
  1. Explain why Janet should never play strategy \(J_4\) [1 mark]
  2. Janet wants to maximise her winnings from the game. She defines the following variables. \(p_1 = \) the probability of Janet playing strategy \(J_1\) \(p_2 = \) the probability of Janet playing strategy \(J_2\) \(p_3 = \) the probability of Janet playing strategy \(J_3\) \(v = \) the value of the game for Janet Janet then formulates her situation as the following linear programming problem. Maximise \(P = v\) subject to \(2p_1 + 5p_2 + 4p_3 \geq v\) \(7p_1 + 5p_2 + 3p_3 \geq v\) \(6p_1 + p_2 + 8p_3 \geq v\) and \(p_1 + p_2 + p_3 \leq 1\) \(p_1, p_2, p_3 \geq 0\)
    1. Complete the initial Simplex tableau for Janet's situation in the grid below. [2 marks]
      \(P\)\(v\)\(p_1\)\(p_2\)\(p_3\)value
    2. Hence, perform one iteration of the Simplex algorithm, showing your answer on the grid below. [2 marks]
      \(P\)\(v\)\(p_1\)\(p_2\)\(p_3\)value
  3. Further iterations of the Simplex algorithm are performed until an optimal solution is reached. The grid below shows part of the final Simplex tableau.
    \(p_1\)\(p_2\)value
    10\(\frac{1}{12}\)
    01\(\frac{1}{2}\)
    Find the probability of Janet playing strategy \(J_3\) when she is playing to maximise her winnings from the game. [1 mark]
AQA Further Paper 3 Discrete 2024 June Q10
7 marks Standard +0.3
A project is undertaken by Higton Engineering Ltd. The project is broken down into 11 separate activities \(A\), \(B\), \(\ldots\), \(K\) Figure 3 below shows a completed activity network for the project, along with the earliest start time, duration, latest finish time and the number of workers required for each activity. All times and durations are given in days. \includegraphics{figure_3}
  1. Write down the critical path. [1 mark]
  2. Using Figure 4 below, draw a resource histogram for the project to show how the project can be completed in the minimum possible time. Assume that each activity is to start as early as possible. [3 marks] \includegraphics{figure_4}
  3. Higton Engineering Ltd only has four workers available to work on the project. Find the minimum completion time for the project. Use Figure 5 below in your answer. [3 marks] \includegraphics{figure_5} Minimum completion time _____________________________________