Garantie de satisfaction à 100% Disponible immédiatement après paiement En ligne et en PDF Tu n'es attaché à rien
logo-home
Recherché précédemment par vous
Recherché précédemment par vous
logo
Pearson Edexcel A-LEVEL Paper 1 Mathematics Advanced Subsidiary/Advanced Level Decision Mathematics D1 January 2024 AUTHENTIC MARKING SCHEME ATTACHED $8.99
Ajouter au panier
Accédez rapidement à
Aperçu
  2.  
  3. MATHEMATICS
  4.  
  5. MATHEMATICS

Examen

Pearson Edexcel A-LEVEL Paper 1 Mathematics Advanced Subsidiary/Advanced Level Decision Mathematics D1 January 2024 AUTHENTIC MARKING SCHEME ATTACHED

 1 fois vendu
  • Cours
  • MATHEMATICS
  • Établissement
  • MATHEMATICS

Pearson Edexcel A-LEVEL Paper 1 Mathematics Advanced Subsidiary/Advanced Level Decision Mathematics D1 January 2024 AUTHENTIC MARKING SCHEME ATTACHED

Aperçu 4 sur 46  pages

Infos sur le Document

  • 18 avril 2024
  • 46
  • 2023/2024
  • Examen
  • Questions et réponses

Sujets

  • pearson edexcel a level paper 1 mathematics

École, étude et sujet

  • MATHEMATICS
  • MATHEMATICS

Vendeur

avatar-seller
RevisionKing

Avis reçus

Aperçu du contenu

Pearson Edexcel International Advanced Level
Wednesday 10 January 2024
Morning (Time: 1 hour 30 minutes)
Paper
reference WDM11/01
Mathematics
 



International Advanced Subsidiary/Advanced Level
Decision Mathematics D1


You must have:
Decision Mathematics Answer Book (enclosed), calculator



Candidates may use any calculator allowed by Pearson regulations.
Calculators must not have the facility for symbolic algebra manipulation,
differentiation and integration, or have retrievable mathematical
formulae stored in them.
Instructions
•• Use black ink or ball-point pen.
If pencil is used for diagrams/sketches/graphs it must be dark (HB or B).
Coloured pencils and highlighter pens must not be used.
• Fill in the boxes on the top of the answer book with your name,
centre number and candidate number.
•• Do not return the question paper with the answer book.
Answer all questions and ensure that your answers to parts of questions are
clearly labelled.
• Answer the questions in the D1 answer book provided
– there may be more space than you need.
• You should show sufficient working to make your methods clear. Answers without
working may not gain full credit.
• Inexact answers should be given to three significant figures unless otherwise stated.
Information
•• There are 7 questions in this question paper. The total mark for this paper is 75.
The marks for each question are shown in brackets
– use this as a guide as to how much time to spend on each question.
Advice
•• Read each question carefully before you start to answer it.
Try to answer every question.
•• Check your answers if you have time at the end.
If you change your mind about an answer, cross it out and put your new answer and
any working underneath.

Turn over


P73481A
©2024 Pearson Education Ltd.
S:1/1/1/1/
*P73481A*

, Write your answers in the D1 answer book for this paper.

1.
D(5)


E(2)
L(12)
A(4)

B(3) G(5) J(6)



C(7) F(6)
H(6) K(5)

I(6)

Figure 1

A project is modelled by the activity network shown in Figure 1. The activities are
represented by the arcs. The number in brackets on each arc gives the time, in hours, to
complete the corresponding activity. Each activity requires one worker. The project is to
be completed in the shortest possible time using as few workers as possible.
(a) Complete Diagram 1 in the answer book to show the early event times and the late
event times.
(4)
(b) Calculate the total float for activity D. You must make the numbers used in your
calculation clear.
(1)
(c) Calculate a lower bound for the minimum number of workers required to complete
the project in the shortest possible time. You must show your working.
(2)
(d) Draw a cascade chart for this project on Grid 1 in the answer book.
(4)
(e) Use your cascade chart to determine the minimum number of workers needed to
complete the project in the shortest possible time. You must make specific reference
to time and activities. (You do not need to provide a schedule of the activities.)
(2)

(Total for Question 1 is 13 marks)




2 P73481A


,2.
A B C D E F G H
A – 34 29 35 28 30 37 38
B 34 – 32 28 39 40 32 39
C 29 32 – 27 33 39 34 31
D 35 28 27 – 35 38 41 36
E 28 39 33 35 – 36 33 40
F 30 40 39 38 36 – 34 39
G 37 32 34 41 33 34 – 35
H 38 39 31 36 40 39 35 –

Table 1
Table 1 represents a network that shows the travel times, in minutes, between eight
towns, A, B, C, D, E, F, G and H.
(a) Use Prim’s algorithm, starting at A, to find the minimum spanning tree for this
network. You must clearly state the order in which you select the edges of your tree.
(3)
(b) State the weight of the minimum spanning tree.
(1)

A B C D E F G H
J 33 37 41 35 x 40 28 42

Table 2
Table 2 shows the travel times, in minutes, between town J and towns A, B, C, D, E, F,
G and H.
The journey time between towns E and J is x minutes where x > 28
A salesperson needs to visit all of the nine towns, starting and finishing at J.
The salesperson wishes to minimise the total time spent travelling.
(c) Starting at J, use the nearest neighbour algorithm to find an upper bound for
the duration of the salesperson’s route. Write down the route that gives this
upper bound.
(2)
Using the nearest neighbour algorithm, starting at E, an upper bound of 291 minutes for
the salesperson’s route was found.
(d) State the best upper bound that can be obtained by using this information and your
answer to (c). Give the reason for your answer.
(1)
Starting by deleting J and all of its arcs, a lower bound of 264 minutes for the duration
of the salesperson’s route was found.
(e) Determine the value of x. You must make your method and working clear.
(3)
(Total for Question 2 is 10 marks)

P73481A 3
 Turn over

, 3.
B 28 E
47
H

17 8 38
20 5
28 C 25 F 40
A J

10 12
39 55 11 18
20

D 37 G

Figure 2

[The total weight of the network is 458]

Figure 2 represents a network of roads between nine towns, A, B, C, D, E, F, G, H and J.
The number on each edge represents the length, in kilometres, of the corresponding road.
(a) (i) Use Dijkstra’s algorithm to find the shortest path from A to J.
(ii) State the length of the shortest path from A to J.
(6)
The roads between the towns must be inspected. Claude must travel along each road at
least once. Claude will start the inspection route at A and finish at J. Claude wishes to
minimise the length of the inspection route.
(b) By considering the pairings of all relevant nodes, find the length of Claude’s route.
State the arcs that will need to be traversed twice.
(5)
If Claude does not start the inspection route at A and finish at J, a shorter inspection
route is possible.
(c) Determine the two towns at which Claude should start and finish so that the
route has minimum length. Give a reason for your answer and state the length of
this route.
(3)

(Total for Question 3 is 14 marks)




4 P73481A


Les avantages d'acheter des résumés chez Stuvia:

Qualité garantie par les avis des clients

Qualité garantie par les avis des clients

Les clients de Stuvia ont évalués plus de 700 000 résumés. C'est comme ça que vous savez que vous achetez les meilleurs documents.

L’achat facile et rapide

L’achat facile et rapide

Vous pouvez payer rapidement avec iDeal, carte de crédit ou Stuvia-crédit pour les résumés. Il n'y a pas d'adhésion nécessaire.

Focus sur l’essentiel

Focus sur l’essentiel

Vos camarades écrivent eux-mêmes les notes d’étude, c’est pourquoi les documents sont toujours fiables et à jour. Cela garantit que vous arrivez rapidement au coeur du matériel.

Foire aux questions

Qu'est-ce que j'obtiens en achetant ce document ?

Vous obtenez un PDF, disponible immédiatement après votre achat. Le document acheté est accessible à tout moment, n'importe où et indéfiniment via votre profil.

Garantie de remboursement : comment ça marche ?

Notre garantie de satisfaction garantit que vous trouverez toujours un document d'étude qui vous convient. Vous remplissez un formulaire et notre équipe du service client s'occupe du reste.

Auprès de qui est-ce que j'achète ce résumé ?

Stuvia est une place de marché. Alors, vous n'achetez donc pas ce document chez nous, mais auprès du vendeur RevisionKing. Stuvia facilite les paiements au vendeur.

Est-ce que j'aurai un abonnement?

Non, vous n'achetez ce résumé que pour $8.99. Vous n'êtes lié à rien après votre achat.

Peut-on faire confiance à Stuvia ?

4.6 étoiles sur Google & Trustpilot (+1000 avis)

64302 résumés ont été vendus ces 30 derniers jours

Fondée en 2010, la référence pour acheter des résumés depuis déjà 15 ans

Commencez à vendre!

Récemment vu par vous

Examen ·

(1)

Test Bank for Fundamentals of Human Neuropsychology 8th Edition By Bryan Kolb, Ian Whishaw| All Chapters Included | Answer Key | Newest Edition 2024

Pack ·

(0)

Exam 2: NUR2513/ NUR 2513 (Latest 2023/ 2024UPDATES STUDY BUNDLE ) Maternal-Child Nursing Exam| Questions and Verified Answers| Already Graded A -Rasmussen

Examen ·

(0)

WGU D050 HISTORY OF HEALTHCARE IN AMERICA FINAL EXAM/ACTUAL EXAM WITH 300 QUSTIONS AND CORRECT DETAILED ANSWERS/ LATEST UPDATE 2023-2024 RATED A+

Examen ·

(0)

Exam 2: NR228/ NR 228 | Latest 2023/2024| Nutrition, Health & Wellness Exam Review| Guide with Questions and Verified Answers | 100% Correct -Chamberlain

Examen ·

(0)

Midterm Exam: NR569 / NR 569 (Latest 2024 / 2025) Differential Diagnosis in Acute Care Practicum | Questions & Answers | 100% Correct | Grade A - Chamberlain

Examen ·

(0)

Exam 1: NUR155/ NUR 155 (New 2024/ 2025 Update) Foundations of Nursing Complete Guide with Questions and Verified Answers| 100% Correct | A Grade - Galen

Examen ·

(0)

Test Bank: Nutritional Foundations and Clinical Applications A Nursing Approach, 8th Edition by Grodner - Chapters 1-20, 9780323810241 | Rationals Included

Examen ·

(0)

Chapter 06: Rau's Respiratory Care Pharmacology, 9th Edition Adrenergic (Sympathomimetic) Bronchodilators Gardenhire Questions with correct answers

Resume ·

(0)

Summary of Strategic & Responsible Foresight - All required literature - University of Twente - International Business Administration - CHANGEL module
$8.99  1x  vendu
  • (0)
Ajouter au panier
Ajouté