0% found this document useful (0 votes)

20 views28 pages

D1 Specimen

This document is a sample assessment material for the Pearson Edexcel Level 3 GCE Further Mathematics Advanced Paper 3D: Decision Mathematics 1, which includes instructions, information, and various mathematical problems to be solved within a time limit of 1 hour and 30 minutes. It covers topics such as sorting algorithms, graph theory, project management, linear programming, and network analysis. The total mark for the paper is 75, and candidates are required to show sufficient working for their answers.

Uploaded by

raghavmenon20

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

20 views28 pages

D1 Specimen

Uploaded by

raghavmenon20

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 28

w

w
w
.m
ym
at
hsc
Pearson Edexcel Level 3 GCE

lo
ud
.c
o m
Sample Assessment Material

(Time: 1 hour 30 minutes) Paper Reference 9FM0/3D

Further Mathematics
Advanced
Paper 3D: Decision Mathematics 1

You must have:

Decision Mathematics Answer Book (enclosed), 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.
• IfWrite
pencil is used for diagrams/sketches/graphs it must be dark (HB or B).
• answeryourbookanswers for this paper in the Decision Mathematics
provided.
• centre number andat candidate
Fill in the boxes the top of the answer book with your name,
number.
• Do not return the question paper with the answer book.
• clearly
Answer all questions and ensure that your answers to parts of questions are
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.
• Answers should be given to three significant figures unless otherwise stated.
Information
• AThere
booklet ‘Mathematical Formulae and Statistical Tables’ is provided.
• The marksare 7 questions in this question paper. The total mark for this paper is 75.
• – use this asfora guide
each question are shown in brackets
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.
Turn over

*S61299A*
S61299A
©2018 Pearson Education Ltd.

1/1/1/1/
w
w
w
.m
ym
at
h
sc
lo
Answer ALL questions. Write your answers in the answer book provided.

ud
.c
o m
1. 6 1 9 14 18 7 10 4 17 13
(a) The list of numbers shown above is to be sorted into descending order. Apply the
quick sort algorithm to obtain the sorted list. You must make your pivots clear.
(3)
(b) Apply the first‑fit decreasing bin packing algorithm to your ordered list to pack the
numbers into bins of size 30
(2)

(Total for Question 1 is 5 marks)

2
S61299A
w
w
w
.m
ym
at
hsc
lo
2.

ud
.c
o m
A B

H C

G D

F E

Figure 1

(a) Write down the number of arcs in a minimum spanning tree for the graph shown in
Figure 1.
(1)
(b) Determine the minimum number of arcs that would need to be added to make the
graph semi‑Eulerian. You must justify your answer.
(2)
Taking AFGHBCDEA as the Hamiltonian cycle,
(c) use the planarity algorithm to determine whether or not the graph shown in Figure 1
is planar. You must make your working clear and justify your answer.
(3)

(Total for Question 2 is 6 marks)

3
S61299A
Turn over
w
w
w
.m
ym
at
h
sc
lo
3.

ud
.c
o m
B 27 E

13 22 12 10
12
A 28
38 D 9 G H
33
14 11
29 12

C 30 F

Figure 2

[The total weight of the network is 300 ]

Figure 2 represents a network of train tracks. The vertices A, B, C, D, E, F, G and H

represent train stations.
(i) The number on each edge represents the time, in minutes, to travel on the
corresponding track.
(a) Use Dijkstra’s algorithm to find the time required to travel the quickest route
from A to H.
(4)
A train is to travel from A to F via H without stopping.
(b) Find the quickest route from A to F via H. State the route and the time taken.
(2)
A train is to travel from A to H, stopping for 1 minute at each train station it passes
through on its route.
(c) Explain how you would adapt the network so that Dijkstra’s algorithm could be
used to find the quickest route for this train. You do not need to find this route.
(2)
(ii) The number on each edge now represent the length, in km, of the corresponding
track. A route that starts at C, finishes at G and traverses each track at least once
needs to be found.
(a) Use an appropriate algorithm to find the length of the shortest route. You must
make your method clear.
(4)
(b) State the tracks that will need to be traversed twice.
(1)

(Total for Question 3 is 13 marks)

4
S61299A
w
w
w
.m
ym
at
hsc
lo
4. The table below lists the durations (in minutes), the immediate preceding activities and

ud
.c
the number of workers required for each activity in a project.

o m
Duration Immediate preceding Number of
Activity
(minutes) activities workers
A 20 ‑ 1
B 15 ‑ 1
C 35 ‑ 2
D 10 C 1
E 35 A 1
F 20 A 2
G 10 A, B, D 1
H 25 C 1
I 30 E 1
J 20 E, F, G, H 2

The project is modelled by the activity network shown in Figure 3. The activities are
represented by the arcs. The project is to be completed in the shortest possible time.

E(35)

A(20) F(20) I(30)

B(15) G(10)
J(20)

D(10)
C(35) H(25)

Figure 3

(a) (i) Calculate the early time and the late time for each event, using Diagram 1 in the
answer book.
(ii) Determine the minimum project completion time.
(iii) Identify the critical activities.
(5)
(b) On Grid 1 in the answer book, draw a resource histogram to show the number of
workers required at each time when each activity begins at its earliest possible start time.
(3)
(c) Determine whether or not the project can be completed in the minimum possible
time by at most four workers. You must justify your answer with reference to your
resource histogram.
(2)

(Total for Question 4 is 10 marks)

5
S61299A
Turn over
w
w
w
.m
ym
at
h
sc
lo
5. Dale is planning a production run of three types of desk. The three types are lectern desk,

ud
.c
roll top desk and writing desk.

o m
In total, Dale has 400 m2 of wood available; each lectern desk requires 3 m2, each
roll top desk requires 5 m2, and each writing desk requires 8 m2
In total, Dale has 350 hours available; each lectern desk requires 3 hours, each
roll top desk requires 6 hours, and each writing desk requires 10 hours.
Once complete, the desks need to be stored in a warehouse. The warehouse has 75 m3 of
storage space available; each lectern desk requires 1 m3, each roll top desk requires 1.5 m3
and each writing desk requires 1.25 m3
The profit on each lectern desk sold is £40, the profit on each roll top desk sold is £50
and the profit on each writing desk sold is £65
Dale wants to maximise his profit.
Let x, y and z be the number of lectern desks, roll top desks and writing desks made
respectively during the production run.
(a) Formulate this situation as a linear programming problem, giving your constraints as
inequalities.
(4)
(b) Complete the initial tableau in the answer book for this linear programming problem.
(2)
(c) Taking the most negative number in the profit row to indicate the pivot column,
perform one complete iteration of the Simplex algorithm. Give an explanation of the
method by clearly stating the row operations you use.
(4)
After a second iteration, the exact values in the tableau are

b.v. x y z s1 s2 s3 Value
s1 0 −0.52 0 1 −0.68 −0.96 90
z 0 0.24 1 0 0.16 −0.48 20
x 1 1.2 0 0 −0.2 1.6 50
P 0 13.6 0 0 2.4 32.8 3300

(d) Use algebra to explain how you know that this tableau is optimal.
(1)
(e) (i) State the optimal number of each type of desk that should be made.
(ii) State the maximum total profit.
(2)
(f) Explain, in context, the meaning of the 90 in the value column.
(2)
(g) Give a reason why the profit may be less than the value stated in (e)(ii).
(1)

(Total for Question 5 is 16 marks)

6
S61299A
w
w
w
.m
ym
at
hsc
lo
6.

ud
.c
A

o m
3
7 B
2
9 C
8
5
6

D 4 E
Figure 4
The network in Figure 4 shows the direct routes linking five towns, A, B, C, D and E.
The edge weights represent distances, in km, between the towns.
(a) For this network, complete the initial distance and route tables provided in the
answer book.
(2)
(b) Perform the first and second iterations of Floyd’s algorithm. You should show the
distance table and the route table after each iteration.
(4)
The final tables after five iterations of Floyd’s algorithm are shown below.

Distance table Route table

A B C D E A B C D E
A – 3 5 9 10 A A B B D C
B 3 – 2 8 7 B A B C C C
C 5 2 – 6 5 C B B C D E
D 9 8 6 – 4 D A C C D E
E 10 7 5 4 – E C C C D E

(c) Draw the complete network of shortest distances.

(2)
(d) (i) Use the nearest neighbour algorithm, starting at vertex E, to produce a
Hamiltonian cycle for the complete network.
(ii) Write down the length of the Hamiltonian cycle.
(2)
(e) Interpret the Hamiltonian cycle from (d) in terms of the towns actually visited.
(1)
(f) Starting by deleting A from the complete network of shortest distances, and all of its
edges, find a lower bound for the solution to the Travelling Salesman problem.
(2)
(g) Use your results to write down the smallest interval that you can be confident
contains the optimal solution to the Travelling Salesman problem.
(2)

(Total for Question 6 is 15 marks)

7
S61299A
Turn over
w
w
w
.m
ym
at
h
sc
lo
7.

ud
.c
o m
y

8
R
6

obje
2 ctiv
e lin
e

O 2 4 6 8 10 x

Figure 5

Figure 5 shows the constraints of a maximisation linear programming problem in x and y,

where R is the feasible region. An objective line is also shown and labelled on Figure 5.
A student decides to find the optimal vertex of R by using the two‑stage Simplex algorithm.
Set up an initial tableau for the two‑stage Simplex algorithm. (You should not solve the
linear programming problem.)

(Total for Question 7 is 10 marks)

TOTAL FOR PAPER IS 75 MARKS

8
S61299A
w
w
w
.m
ym
at
hsc
lo
Please check the examination details below before entering your candidate information

ud
.c
Candidate surname Other names

o m
Centre Number Candidate Number
Pearson Edexcel
Level 3 GCE
Sample Assessment Material

(Time: 1 hour 30 minutes) Paper Reference 9FM0/3D

Further Mathematics
Advanced
Paper 3D: Decision Mathematics 1

Answer book Total Marks

Do not return the question paper with the answer book.

Turn over

*S61299A0120*
S61299A
©2018 Pearson Education Ltd.

1/1/1/1/
w
w
w
.m
ym
at
h
sc
lo
ud
.c
1. 6 1 9 14 18 7 10 4 17 13

mo
_____________________________________________________________________________________

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
r
_____________________________________________________________________________________
la
_____________________________________________________________________________________
FpT

DO NOT WRITE IN THIS AREA

exR

D
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

2
*S61299A0220*
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 1 continued

o m
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
_____________________________________________________________________________________
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
xReA

DO NOT WRITE IN THIS AREA

(Total for Question 1 is 5 marks)

3
*S61299A0320* Turn over
w
w
w
.m
ym
at
h
sc
lo
ud
.c
2.

mo
A B

DO NOT WRITE IN THIS AREA

H C

G D

F E

Figure 1
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
A

DO NOT WRITE IN THIS AREA

exR

4
*S61299A0420*
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 2 continued

o m
A B
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

H C

G D

F E

_____________________________________________________________________________________
_____________________________________________________________________________________
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
xReA

DO NOT WRITE IN THIS AREA

(Total for Question 2 is 6 marks)

5
*S61299A0520* Turn over
3.
D

6
E
B 27
exR
emA
13 22 12 12 10

A D G H
38 9 28
FpT
33
la
11 12
29
r
F
C 30

*S61299A0620*
Key:

Order of Final
Vertex
labelling value
w
Working values w
w
Time required to travel quickest route from A to H: _______________________________________ ym
.m
at
sc h
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA lo
ud
.c
m o
DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA
D
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 3 continued

o m
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
_____________________________________________________________________________________
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
xReA

DO NOT WRITE IN THIS AREA

7
*S61299A0720* Turn over
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 3 continued

mo
B 27 E

DO NOT WRITE IN THIS AREA

13 22 12 10
12
A 28
38 D 9 G H
33
14 11
29 12

C 30 F
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
r
_____________________________________________________________________________________
_____________________________________________________________________________________
la
FpT

DO NOT WRITE IN THIS AREA

exR

_____________________________________________________________________________________
D
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________

8
*S61299A0820*
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 3 continued

o m
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

(Total for Question 3 is 13 marks)

9
*S61299A0920* Turn over
w
w
w
.m
ym
at
hsc
lo
ud
.c
4.

mo
E(35)

DO NOT WRITE IN THIS AREA

A(20) F(20) I(30)

B(15) G(10)
J(20)

D(10) Key:
H(25)

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA
C(35) Early
event
time
Late
r
event
time
la
FpT

Diagram 1
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
emA

DO NOT WRITE IN THIS AREA

exR

10
*S61299A01020*
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 4 continued

o m
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
Number of
workers
DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA

6
5
ar
4
3
2
1
pTl

Minutes
5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
xReA

DO NOT WRITE IN THIS AREA

(Total for Question 4 is 10 marks)

11
*S61299A01120* Turn over
w
w
w
.m
ym
at
h
sc
lo
ud
.c
5.

mo
_____________________________________________________________________________________

DO NOT WRITE IN THIS AREA

b.v. x y z s1 s2 s3 Value

400

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA
350
r
75
la
P
FpT

(c)

b.v. x y z s1 s2 s3 Value Row Ops

emA

DO NOT WRITE IN THIS AREA

exR

b.v. x y z s1 s2 s3 Value Row Ops

D
P

12
*S61299A01220*
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 5 continued

o m
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
_____________________________________________________________________________________
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
xReA

DO NOT WRITE IN THIS AREA

(Total for Question 5 is 16 marks)

13
*S61299A01320* Turn over
w
w
w
.m
ym
at
hsc
lo
ud
.c
6. (a)

mo
Initial Distance table Initial Route table
A B C D E A B C D E

DO NOT WRITE IN THIS AREA

A A

B B

C C

D D

E E

(b) 1st Iteration

Distance table Route table
A B C D E A B C D E
A A

B B

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA
C C

D D
r
E E
la
2nd Iteration
FpT

Distance table Route table

A B C D E A B C D E
A A

B B
em

C C
A

D D

E E
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

exR

Spare tables
Distance table Route table
A B C D E A B C D E
D

A A
D
B B

C C

D D

E E

14
*S61299A01420*
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 6 continued

o m
(c)
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

A
B

D E
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA
DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
_____________________________________________________________________________________
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
xReA

DO NOT WRITE IN THIS AREA

mo
_____________________________________________________________________________________

DO NOT WRITE IN THIS AREA

exR

16
*S61299A01620*
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 6 continued

o m
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
_____________________________________________________________________________________
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
xReA

DO NOT WRITE IN THIS AREA

(Total for Question 6 is 15 marks)

17
*S61299A01720* Turn over
w
w
w
.m
ym
at
h
sc
lo
ud
.c
7.

mo
y

DO NOT WRITE IN THIS AREA

8
R
6

DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA
obje
2 ctiv
e lin
e
r
O 2 4 6 8 10 x
la
FpT

Figure 5
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
_____________________________________________________________________________________
emA

DO NOT WRITE IN THIS AREA

exR

18
*S61299A01820*
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 7 continued

o m
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

_____________________________________________________________________________________
mF

_____________________________________________________________________________________
_____________________________________________________________________________________
DO NOT WRITE IN THIS AREA

DO NOT WRITE IN THIS AREA

19
*S61299A01920* Turn over
w
w
w
.m
ym
at
hsc
lo
ud
.c
Question 7 continued

mo
_____________________________________________________________________________________

DO NOT WRITE IN THIS AREA

b.v. Value
DO NOT WRITE IN THIS AREA
exR
D

D
(Total for Question 7 is 10 marks)

TOTAL FOR PAPER IS 75 MARKS

20
*S61299A02020*

3D A Level Decision Mathematics 1 QP
No ratings yet
3D A Level Decision Mathematics 1 QP
36 pages
9FM0-3D AL Decision 1 Papers (All To 2024)
No ratings yet
9FM0-3D AL Decision 1 Papers (All To 2024)
178 pages
Network Analysis Maximal Flow: Results 1 1 1 1 1 1 1 1
No ratings yet
Network Analysis Maximal Flow: Results 1 1 1 1 1 1 1 1
6 pages
Lecture 6 Algorithms and Problem Solving
No ratings yet
Lecture 6 Algorithms and Problem Solving
29 pages
縮,D1
No ratings yet
縮,D1
308 pages
9-12 DBMS
No ratings yet
9-12 DBMS
589 pages
Ilovepdf Merged
No ratings yet
Ilovepdf Merged
360 pages
OR1 20107 Scheduling
No ratings yet
OR1 20107 Scheduling
50 pages
June 2017 QP D1
No ratings yet
June 2017 QP D1
32 pages
Thursday 2020: Further Mathematics
No ratings yet
Thursday 2020: Further Mathematics
20 pages
07a 9fm0-3d Decision Mathematics 1 Mock Paper
No ratings yet
07a 9fm0-3d Decision Mathematics 1 Mock Paper
12 pages
2206 9FM0-3D AL Decision Mathematics 1 June 2022 Shadow Paper (With Answer Book) PDF
No ratings yet
2206 9FM0-3D AL Decision Mathematics 1 June 2022 Shadow Paper (With Answer Book) PDF
32 pages
Unit - 4
No ratings yet
Unit - 4
103 pages
DSA Presentation
No ratings yet
DSA Presentation
23 pages
Lecture 11a - Introduction To Graphs
No ratings yet
Lecture 11a - Introduction To Graphs
17 pages
6689 01 Que 20080111
No ratings yet
6689 01 Que 20080111
24 pages
June 2019 QP - DM1 Edexcel Further Maths As-Level
No ratings yet
June 2019 QP - DM1 Edexcel Further Maths As-Level
5 pages
Decision Paper Speciemen
No ratings yet
Decision Paper Speciemen
8 pages
June 2020 QP
No ratings yet
June 2020 QP
32 pages
January 2021 QP
No ratings yet
January 2021 QP
32 pages
June 2022 QP
No ratings yet
June 2022 QP
20 pages
June 2019 QP 2
No ratings yet
June 2019 QP 2
32 pages
Viva Questions For Aiml Lab
No ratings yet
Viva Questions For Aiml Lab
5 pages
File Organization and Indexing - DPP 01
No ratings yet
File Organization and Indexing - DPP 01
8 pages
Spell Check and Soundex
No ratings yet
Spell Check and Soundex
19 pages
Thursday 14 May 2020: Further Mathematics
No ratings yet
Thursday 14 May 2020: Further Mathematics
20 pages
WDM11 01 Que 20211020
No ratings yet
WDM11 01 Que 20211020
32 pages
June 2023 QP 7
No ratings yet
June 2023 QP 7
20 pages
2020 D1 Alevel
No ratings yet
2020 D1 Alevel
32 pages
Practical 1 Information Security-Rachit Anand (2021UIN3334)
No ratings yet
Practical 1 Information Security-Rachit Anand (2021UIN3334)
3 pages
Esdat Unit 2 Activity 2
No ratings yet
Esdat Unit 2 Activity 2
4 pages
June 2023 QP
No ratings yet
June 2023 QP
36 pages
January 2020 QP
No ratings yet
January 2020 QP
28 pages
Decision 22
No ratings yet
Decision 22
18 pages
8fm0 27 Que 20240518
No ratings yet
8fm0 27 Que 20240518
20 pages
EDAP01
No ratings yet
EDAP01
4 pages
6689 01 Que 20160617
No ratings yet
6689 01 Que 20160617
28 pages
2022 Alevel
No ratings yet
2022 Alevel
36 pages
D1 May 2024
No ratings yet
D1 May 2024
12 pages
Introduction To Algorithms
No ratings yet
Introduction To Algorithms
23 pages
DSA Imp Question Bank by MCA SCHOLARS Group
No ratings yet
DSA Imp Question Bank by MCA SCHOLARS Group
2 pages
June 2022 QP - DM1 Edexcel Further Maths As-Level
No ratings yet
June 2022 QP - DM1 Edexcel Further Maths As-Level
8 pages
Fahima Haque 04210101571 CSE Lab Report:: Implement A Binary Tree and Describe All The Operations
No ratings yet
Fahima Haque 04210101571 CSE Lab Report:: Implement A Binary Tree and Describe All The Operations
9 pages
Data Structures and Algorithms
No ratings yet
Data Structures and Algorithms
30 pages
3d Decision 1 QP
No ratings yet
3d Decision 1 QP
32 pages
9FM0-3D A Level Decision Mathematics 1 - October 2020 - Question Paper
No ratings yet
9FM0-3D A Level Decision Mathematics 1 - October 2020 - Question Paper
32 pages
Be - Artificial Intelligence and Data Science - Semester 4 - 2024 - March - Data Structures and Algorithms Ds A 2019 Pattern
No ratings yet
Be - Artificial Intelligence and Data Science - Semester 4 - 2024 - March - Data Structures and Algorithms Ds A 2019 Pattern
2 pages
DAA Mini Project Report Atul
No ratings yet
DAA Mini Project Report Atul
17 pages
8FM0-27 AS Decision Mathematics 1 - May 2018
No ratings yet
8FM0-27 AS Decision Mathematics 1 - May 2018
8 pages
1906 D1 - June 2019 PDF
No ratings yet
1906 D1 - June 2019 PDF
32 pages
9FM0-3D AL Decision 1 Practice Paper 1 PDF
No ratings yet
9FM0-3D AL Decision 1 Practice Paper 1 PDF
23 pages
Sample QP - DM1 Edexcel Further Maths As-Level
No ratings yet
Sample QP - DM1 Edexcel Further Maths As-Level
3 pages
October 2021 QP
No ratings yet
October 2021 QP
32 pages
June 2022 QP
No ratings yet
June 2022 QP
32 pages
WDM01 01 Que 20201015
No ratings yet
WDM01 01 Que 20201015
32 pages
WDM11 01 Que 20210304
No ratings yet
WDM11 01 Que 20210304
32 pages
D1 January 2003
No ratings yet
D1 January 2003
8 pages
downloadMathsA LevelPapersEdexcel FurtherDecision 1QPJune20201920QP PDF
No ratings yet
downloadMathsA LevelPapersEdexcel FurtherDecision 1QPJune20201920QP PDF
32 pages
Jan 2021 Decision 1 Ial Maths Edexcel QP
No ratings yet
Jan 2021 Decision 1 Ial Maths Edexcel QP
32 pages
D1 2019 and Answer Booklet
No ratings yet
D1 2019 and Answer Booklet
32 pages
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
No ratings yet
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
24 pages
SLIQ - Fast Scalable Classifier: Decision Trees
No ratings yet
SLIQ - Fast Scalable Classifier: Decision Trees
36 pages
The Queue Interface
No ratings yet
The Queue Interface
2 pages
Lec7 Recursive Functions
No ratings yet
Lec7 Recursive Functions
28 pages
L2-AI Technique, Tic - Tac - Toe Problem.
No ratings yet
L2-AI Technique, Tic - Tac - Toe Problem.
16 pages
Further Mathematics: Pearson Edexcel Level 3 GCE
No ratings yet
Further Mathematics: Pearson Edexcel Level 3 GCE
12 pages
9FM0-3D AL Decision 1 Practice Paper 4 (Word)
No ratings yet
9FM0-3D AL Decision 1 Practice Paper 4 (Word)
20 pages
Summer 2013 Master of Science in Information Technology (Mscit) Revised Fall 2011 Semester 1 Mit102 - Data & File Structures - 4 Credits
No ratings yet
Summer 2013 Master of Science in Information Technology (Mscit) Revised Fall 2011 Semester 1 Mit102 - Data & File Structures - 4 Credits
1 page
Data Structures: G S Lehal
No ratings yet
Data Structures: G S Lehal
71 pages
KNN Dan KMeans
No ratings yet
KNN Dan KMeans
37 pages
Steiner Tree Construction Heuristic
No ratings yet
Steiner Tree Construction Heuristic
19 pages
Oct 20 IAL QP
No ratings yet
Oct 20 IAL QP
32 pages
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
No ratings yet
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
32 pages
Oct 2020 Decision 1 Ial Maths Edexcel QP
No ratings yet
Oct 2020 Decision 1 Ial Maths Edexcel QP
32 pages
Further Mathematics: Friday 23 June 2023
No ratings yet
Further Mathematics: Friday 23 June 2023
36 pages
2306 9FM0 3D A Level Decision Mathematics 1 June 2023 PDF
No ratings yet
2306 9FM0 3D A Level Decision Mathematics 1 June 2023 PDF
16 pages
Dsa Report
No ratings yet
Dsa Report
14 pages
D1 January 2012 Question Paper
No ratings yet
D1 January 2012 Question Paper
32 pages
WDM01 01 Que 20190621
No ratings yet
WDM01 01 Que 20190621
28 pages
BSC Part 3
No ratings yet
BSC Part 3
29 pages
3 Hours / 70 Marks: Seat No
No ratings yet
3 Hours / 70 Marks: Seat No
2 pages
Edexcel数学qp 202401 Math d1
No ratings yet
Edexcel数学qp 202401 Math d1
28 pages
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
No ratings yet
Edexcel GCE: Decision Mathematics D1 Advanced/Advanced Subsidiary
12 pages
June 2024 A Level D1 Paper
No ratings yet
June 2024 A Level D1 Paper
16 pages
9fm0 3d Que 20240622
No ratings yet
9fm0 3d Que 20240622
36 pages
wdm11 01 Que 20230602
No ratings yet
wdm11 01 Que 20230602
32 pages
2306 8FM0 27 AS Decision Mathematics 1 - June 2023 PDF
No ratings yet
2306 8FM0 27 AS Decision Mathematics 1 - June 2023 PDF
8 pages

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.