home AS/A2 d1 AS/A2
d1 graphic calculatorAll specifications allow use of a graphic calculator.
The post 2004 version of this site is available at...
Interactive ASA2 - Decision maths D1
You will be redirected there automatically
1. Algorithms
2. Algorithms on graphs
3. The route inspection problem
4. Critical path analysis		 5. Linear programming
6. Matchings
7. Flows in networks
Summary
Glossary of terms

[x] A algorithm arc B bipartite graph C capacity of a cut complete graph complete matching connected cut cycle D degree digraph directed edges E edge G graph H Hamiltonian cycle Hamiltonian graph M matching minimum connector minimum spanning tree N network node P path planar S spanning tree T total float tree V valency vertex W weighted graph

return to top1. Algorithms
flow charts Flash powered - you will need the Flash 5 plugin
Sorting bubble sort algorithm
quick sort algorithm Flash powered - you will need the Flash 5 plugin
Bin packing first fit algorithm Flash powered - you will need the Flash 5 plugin
first fit decreasing algorithm Flash powered - you will need the Flash 5 plugin
Searching binary search Flash powered - you will need the Flash 5 plugin
 
return to top2. Algorithms on graphs
Minimum connector prim’s algorithm Flash powered - you will need the Flash 5 plugin
kruskal’s algorithm Flash powered - you will need the Flash 5 plugin
Shortest path dijkstra's algorithm Flash powered - you will need the Flash 5 plugin
Planarity planarity algorithm Flash powered - you will need the Flash 5 plugin
 
return to top3. Route inspection
chinese postman algorithm Flash powered - you will need the Flash 5 plugin
 
return to top4. Critical path analysis
activity networks Flash powered - you will need the Flash 5 plugin
event times Flash powered - you will need the Flash 5 plugin  
critical activities Flash powered - you will need the Flash 5 plugin
float Flash powered - you will need the Flash 5 plugin
gantt (cascade) charts
scheduling
 
return to top5. Linear programming
formulating the problem Flash powered - you will need the Flash 5 plugin  
graphical algorithm Flash powered - you will need the Flash 5 plugin
simplex algorithm
 
return to top6. Matchings
exam question 2003 Flash powered - you will need the Flash 5 plugin
 
return to top7. Flows in networks
capacity of a cut Flash powered - you will need the Flash 5 plugin
maximum flow algorithm  
 
return to topSummary
algorithm matching Hot Potatoes
true or false JavaScript interactive pages

Credits
JavaMath interactive graphs =Javamath graphs webEQ interactive equations =WebEQ equations Hot Eqn =HotEqn equations
Cinderella interactive graphs =Cinderella graphs JavaScript interactive pages =JavaScript a Java applet =other Java applets
plane graphic calculator =PGC graphic calculator Hot Potatoes =Hot Potatoes dynamic HTML Flash powered - you will need the Flash 5 plugin =Flash
Flash movies designed by Helen Foster, Alton College, UK, and used with her permission.
© Mathsnet 2003