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)

AQA-7367-3D-FURTHER MATHEMATICS QUESTION PAPER 3D;Discrete-A LEVEL-7Jun24-PM

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

AQA-7367-3D-FURTHER MATHEMATICS QUESTION PAPER 3D;Discrete-A LEVEL-7Jun24-PM. 2 Do not write outside the box (02) G/Jun24/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. [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 000002 Page 2 of 24 FURTHER MATHEMATICS 3 Do not write outside the box (03) G/Jun24/7367/3D Turn over U 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] G is a tree G is complete G is Eulerian G is planar Turn over for the next question 000003 Page 3 of 24 FURTHER MATHEMATICS 4 Do not write outside the box (04) G/Jun24/7367/3D 4 Daniel and Jackson play a zero-sum game. The game is represented by the following pay-off matrix for Daniel. Jackson Strategy W X Y Z Daniel A 3 –2 1 4 B 5 1 –4 1 C 2 –1 1 2 D –3 0 2 –1 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] _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________ _____________________________________________________________________________________

Meer zien Lees minder
Instelling
Vak

Voorbeeld van de inhoud

000001




AQA
AQA



Please write clearly in block capitals.


Centre number Candidate number


Surname _________________________________________________________________________




S
Forename(s) _________________________________________________________________________




C
Candidate signature _________________________________________________________________________
I declare this is my own work.




TI
A-level



A
EM
FURTHER MATHEMATICS
Paper 3 Discrete
TH
Friday 7 June 2024 Afternoon Time allowed: 2 hours
A

Materials
l You must have the AQA Formulae and statistical tables booklet for For Examiner’s Use
M


A-level Mathematics and A-level Further Mathematics. Question Mark
l You should have a graphical or scientific calculator that meets the
requirements of the specification. 1
l You must ensure you have the other optional Question Paper/Answer Book
ER




for which you are entered (either Mechanics or Statistics). You will have 2
2 hours to complete both papers.
3
Instructions 4
TH




l Use black ink or black ball-point pen. Pencil should only be used for drawing.
l Fill in the boxes at the top of this page.
5
l Answer all questions.
l You must answer each question in the space provided for that question. 6
If you require extra space for your answer(s), use the lined pages at the end
R




of this book. Write the question number against your answer(s). 7
l Do not write outside the box around each page or on blank pages.
FU




l Show all necessary working; otherwise marks for method may be lost. 8
l Do all rough work in this book. Cross through any work that you do not want
to be marked. 9

Information 10
l The marks for questions are shown in brackets.
TOTAL
l The maximum mark for this paper is 50.


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




G/LM/Jun24/G4006/V9 7367/3D
Page 1 of 24

,000002

2
Do not write
outside the
box
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.
[1 mark]


Set Binary Operation




S
{1, 2, 3} Addition modulo 4




C
{1, 2, 3} Multiplication modulo 4




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




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



2
EM
A student is trying to find the solution to the travelling salesperson problem for
a network.
TH
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
A

Based on the above information only, which of the following pairs give the best lower
M


bound and best upper bound for the solution of this problem?
Tick () one box.
ER




[1 mark]


Best Lower Bound Best Upper Bound
TH




15 48
R




15 51
FU




19 48

19 51




(02)
G/Jun24/7367/3D
Page 2 of 24

, 000003

3
Do not write
outside the
box
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




S
D 1 0 1 0




C
Which one of the following statements about G is true?




TI
Tick () one box.
[1 mark]




A
G is a tree


G is complete
EM
TH
G is Eulerian
A

G is planar
M
ER




Turn over for the next question
TH
R
FU




Turn over U


(03)
G/Jun24/7367/3D
Page 3 of 24

Geschreven voor

Vak

Documentinformatie

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

Onderwerpen

$13.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


Ook beschikbaar in voordeelbundel

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.
revisionmaster111 Arizona State University
Volgen Je moet ingelogd zijn om studenten of vakken te kunnen volgen
Verkocht
39
Lid sinds
2 jaar
Aantal volgers
24
Documenten
455
Laatst verkocht
2 maanden geleden

4.5

11 beoordelingen

5
8
4
2
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