Scribd
Upload
82 views3 pages

Decision 1 Mathematics Past Paper

The document outlines the Pearson Edexcel Level 3 GCE Mathematics Advanced Level Paper for Decision 1 Mathematics, which includes instructions for candidates and a series of questions on algorithms, route inspection, and graph theory. Candidates are required to explain various mathematical principles and provide sample problems for each. The exam lasts 2 hours and requires specific materials, including a calculator that complies with Pearson regulations.

Uploaded by

anne.s.khairi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
82 views3 pages

Decision 1 Mathematics Past Paper

The document outlines the Pearson Edexcel Level 3 GCE Mathematics Advanced Level Paper for Decision 1 Mathematics, which includes instructions for candidates and a series of questions on algorithms, route inspection, and graph theory. Candidates are required to explain various mathematical principles and provide sample problems for each. The exam lasts 2 hours and requires specific materials, including a calculator that complies with Pearson regulations.

Uploaded by

anne.s.khairi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Pearson Edexcel Level 3 GCE Mathematics

Advanced Level Paper: Decision 1 Mathematics


Time: 2 hours
You must have: Mathematical Formulae and Statistical Tables, calculator

Candidates may use any calculator permitted by Pearson regulations. Calculators must not
have the facility for algebraic 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).
Answer all questions and ensure that your answers to parts of questions are clearly
labelled.
Answer the questions in the spaces 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.

Questions

Algorithms
Q1. Explain the principle of Kruskal’s algorithm and provide a sample problem where
it might be applied. (10 marks)
Answer:

Q2. Explain the principle of Prim’s algorithm and provide a sample problem where it
might be applied. (10 marks)
Answer:

Q3. Explain the principle of Applying Prim’s algorithm to a distance matrix and
provide a sample problem where it might be applied. (10 marks)
Answer:
Q4. Explain the principle of Using Dijkstra’s algorithm to find the shortest path and
provide a sample problem where it might be applied. (10 marks)
Answer:

Q5. Explain the principle of Floyd’s algorithm and provide a sample problem where it
might be applied. (10 marks)
Answer:

Route Inspection
Q1. Explain the principle of Eulerian graphs and provide a sample problem where it
might be applied. (10 marks)
Answer:

Q2. Explain the principle of Using the route inspection algorithm and provide a
sample problem where it might be applied. (10 marks)
Answer:

Q3. Explain the principle of Networks with more than four odd nodes and provide a
sample problem where it might be applied. (10 marks)
Answer:

Graphs and Networks


Q1. Explain the principle of Modelling with graphs and provide a sample problem
where it might be applied. (10 marks)
Answer:

Q2. Explain the principle of Graph theory and provide a sample problem where it
might be applied. (10 marks)
Answer:

Q3. Explain the principle of Special types of graph and provide a sample problem
where it might be applied. (10 marks)
Answer:

Q4. Explain the principle of Representing graphs and networks using matrices and
provide a sample problem where it might be applied. (10 marks)
Answer:
Q5. Explain the principle of The planarity algorithm and provide a sample problem
where it might be applied. (10 marks)
Answer:

You might also like