Geschreven door studenten die geslaagd zijn Direct beschikbaar na je betaling Online lezen of als PDF Verkeerd document? Gratis ruilen 4,6 TrustPilot
logo-home
Tentamen (uitwerkingen)

A-level FURTHER MATHEMATICS Paper 3 Discrete

Beoordeling
-
Verkocht
-
Pagina's
29
Cijfer
A+
Geüpload op
09-09-2024
Geschreven in
2024/2025

A-level FURTHER MATHEMATICS Paper 3 Discrete Friday 7 June 2024 Afternoon Time allowed: 2 hours Materials  You must have the AQA Formulae and statistical tables booklet for A-level Mathematics and A-level Further Mathematics.  You should have a graphical or scientific calculator that meets the requirements of the specification.  You must ensure you have the other optional Question Paper/Answer Book for which you are entered (either Mechanics or Statistics). You will have 2 hours to complete both papers. Instructions  Use black ink or black ball-point pen. Pencil should only be used for drawing.  Fill in the boxes at the top of this page.  Answer all questions.  You must answer each question in the space provided for that question. If you require extra space for your answer(s), use the lined pages at the end of this book. Write the question number against your answer(s).  Do not write outside the box around each page or on blank pages.  Show all necessary working; otherwise marks for method may be lost.  Do all rough work in this book. Cross through any work that you do not want to be marked. Information  The marks for questions are shown in brackets.  The maximum mark for this paper is 50. Advice  Unless stated otherwise, you may quote formulae, without proof, from the booklet.  You do not necessarily need to use all the space provided. (JUN2473673D01) G/LM/Jun24/G4006/V9 7367/3D Answer all questions in the spaces provided. 1 Which one of the following sets forms a group under the given binary operation? Tick () one box. box Set Binary Operation {1, 2, 3} Addition modulo 4 {1, 2, 3} Multiplication modulo 4 {0, 1, 2, 3} Addition modulo 4 {0, 1, 2, 3} Multiplication modulo 4 2 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 [1 mark] 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 () one box. [1 mark] Best Lower Bound Best Upper Bound 15 48 15 51 19 48 19 51 3 The simple-connected graph G has the adjacency matrix A B C D A 0 1 1 1 B 1 0 1 0 C 1 1 0 1 D 1 0 1 0 Which one of the following statements about G is true? Tick () one box. [1 mark] box G is a tree G is complete G is Eulerian G is planar Turn over for the next question Turn over U 4 Daniel and Jackson play a zero-sum game. The game is represented by the following pay-off matrix for Daniel. box Jackson Daniel Neither player has any strategies which can be ignored due to dominance. 4 (a) Prove that the game does not have a stable solution. Fully justify your answer. [3 marks] 4 (b) Determine the play-safe strategy for each player. [1 mark] box Play-safe strategy for Daniel Play-safe strategy for Jackson Turn over for the next question Turn over U 5 The owners of a sports s

Meer zien Lees minder
Instelling
Vak

Voorbeeld van de inhoud

Mathematics paper3




Please write clearly in block capitals.


Centre number Candidate number


Surname Forename(s)
Candidate signature



I declare this is my own work.



A-level
FURTHER MATHEMATICS
Paper 3 Discrete

Friday 7 June 2024 Afternoon Time allowed: 2 hours
Materials
 You must have the AQA Formulae and statistical tables For Examiner’s Use
booklet for A-level Mathematics and A-level Further Questio Mark
Mathematics. n
 You should have a graphical or scientific calculator that
1
meets the requirements of the specification.
 You must ensure you have the other optional Question 2
Paper/Answer Book for which you are entered (either Mechanics or
Statistics). You will have 3
2 hours to complete both papers.
4
Instructions
5
 Use black ink or black ball-point pen. Pencil should only be used for drawing.
 Fill in the boxes at the top of this page.
6
 Answer all questions.
 You must answer each question in the space provided for that question.
7
If you require extra space for your answer(s), use the lined pages at
the end of this book. Write the question number against your 8
answer(s).
 Do not write outside the box around each page or on blank pages. 9
 Show all necessary working; otherwise marks for method may be lost.
 Do all rough work in this book. Cross through any work that you do 10
not want to be marked. TOTAL
Information
 The marks for questions are shown in brackets.
 The maximum mark for this paper is 50.



Mathematics paper3

,Mathematics paper3

Advice
 Unless stated otherwise, you may quote formulae, without proof, from the booklet.
 You do not necessarily need to use all the space provided.




(JUN2473673D01)
G/LM/Jun24/G4006/V9 7367/3D




Mathematics paper3

, 2
Do not write
outside the
Answer all questions in the spaces provided. box




1 Which one of the following sets forms a group under the given binary
operation? Tick () one box.
[1 mark]


Set Binary Operation

{1, 2, 3} Addition modulo 4

{1, 2, 3} Multiplication
modulo 4
{0, 1, 2, 3} Addition modulo 4

{0, 1, 2, 3} Multiplication
modulo 4


2 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 () one box.
[1 mark]


Best Lower Bound Best Upper Bound

15 48

15 51

19 48

19 51




(02
) G/
Jun24/7367/3D

Geschreven voor

Vak

Documentinformatie

Geüpload op
9 september 2024
Aantal pagina's
29
Geschreven in
2024/2025
Type
Tentamen (uitwerkingen)
Bevat
Alleen vragen

Onderwerpen

$12.49
Krijg toegang tot het volledige document:

Verkeerd document? Gratis ruilen Binnen 14 dagen na aankoop en voor het downloaden kun je een ander document kiezen. Je kunt het bedrag gewoon opnieuw besteden.
Geschreven door studenten die geslaagd zijn
Direct beschikbaar na je betaling
Online lezen of als PDF

Maak kennis met de verkoper

Seller avatar
De reputatie van een verkoper is gebaseerd op het aantal documenten dat iemand tegen betaling verkocht heeft en de beoordelingen die voor die items ontvangen zijn. Er zijn drie niveau’s te onderscheiden: brons, zilver en goud. Hoe beter de reputatie, hoe meer de kwaliteit van zijn of haar werk te vertrouwen is.
margaretmbugua453 Cambridge College
Volgen Je moet ingelogd zijn om studenten of vakken te kunnen volgen
Verkocht
35
Lid sinds
2 jaar
Aantal volgers
27
Documenten
235
Laatst verkocht
1 jaar geleden

4.3

7 beoordelingen

5
5
4
1
3
0
2
0
1
1

Recent door jou bekeken

Waarom studenten kiezen voor Stuvia

Gemaakt door medestudenten, geverifieerd door reviews

Kwaliteit die je kunt vertrouwen: geschreven door studenten die slaagden en beoordeeld door anderen die dit document gebruikten.

Niet tevreden? Kies een ander document

Geen zorgen! Je kunt voor hetzelfde geld direct een ander document kiezen dat beter past bij wat je zoekt.

Betaal zoals je wilt, start meteen met leren

Geen abonnement, geen verplichtingen. Betaal zoals je gewend bent via iDeal of creditcard en download je PDF-document meteen.

Student with book image

“Gekocht, gedownload en geslaagd. Zo makkelijk kan het dus zijn.”

Alisha Student

Bezig met je bronvermelding?

Maak nauwkeurige citaten in APA, MLA en Harvard met onze gratis bronnengenerator.

Bezig met je bronvermelding?

Veelgestelde vragen