# data[].attributes.body
D1 June 2006 answers

# data[].attributes.body
D1 June 2006 Question paper

# data[].attributes.body
D1 Jan 2006 Answers

# data[].attributes.body
D1 JAN 2006 Question paper

# data[].attributes.attachment_link.title
AQA Decision 1 4.01a Introducing Minimum Spanning Trees and Kruskal's Algorithm

# data[].attributes.attachment_link.description
I introduce the concept of finding a minimum spanning tree for a network by working through an example of Kruskal's Algorithm.

# data[].attributes.body
D1 Jan 2013

# data[].attributes.body
D1 June 2014

# data[].attributes.body
D1 June 2015

# data[].attributes.body
Prims from a network

# data[].attributes.attachment_link.entities[].name
AQA Edexcel OCR & MEI Decision Mathematics

# data[].attributes.body
Dijkstra

# data[].attributes.attachment_link.entities[].name
Algorithm Single Source Shortest Path Graph Algorithm

# data[].attributes.attachment_link.description
Finds the shortest distance from a given point to anywhere in a network

# data[].attributes.body
Chinese Posman

# data[].attributes.attachment_link.description
Chinese Postman exam question, 9997 June 2013 que 3.

# data[].attributes.body
Quick sort

# data[].attributes.attachment_link.title
AQA Decision 1 2.04a Quick Sort: introducing live and dead pivots

# data[].attributes.attachment_link.description
I introduce my method for Quick Sort, making it clear which numbers are used as pivots.

# data[].attributes.body
Shell sort

# data[].attributes.attachment_link.title
AQA Decision 1 2.03a Shell Sort - an example with 8 numbers

# data[].attributes.attachment_link.description
I introduce using shell sort and explain the underlying shuttle sorts that are being used.

# data[].attributes.body
TSP Lower bound - vertex deletion

# data[].attributes.attachment_link.title
AQA Decision 1 8.05 The Travelling Salesperson Problem: The Lower Bound Algorithm

# data[].attributes.attachment_link.description
I work through a first try at the Lower Bound Algorithm and discuss what our result means alongside the upper bound given by the Nearest Neighbour Algorithm

# data[].attributes.body
TSP Upper bound - nearest neigbour

# data[].attributes.attachment_link.title
AQA Decision 1 8.04 The Travelling Salesperson Problem: The Nearest Neighbour Algorithm

# data[].attributes.attachment_link.description
I work through an example of the Nearest Neighbour Algorithm using a matrix and go through what to look out for.

# data[].attributes.body
Travelling sales introduction

# data[].attributes.body
Linear programming