Wk 17/18

Term 2 2012

Learning Brief
Revision week: Cyclic Groups Eulers Path & Circuits Hamiltonian Path & Circuits MST using Prims & Kruskals algorithm Shortest Path using Dijsktras algorithm Handshake lemma, Pigeon-hole principle Chinese Postman, Travelling Salesman problems

SME1: Number Theory, Graphs and Networks

Goals
Ensure that you have had your investigations sighted by a teacher, and that you have completed all online requirements to avoid a VGrade.

Theoretical Components
Review your work by re-visiting the learning briefs from Week 10-16. Go through each of the worked examples.

Practical Components
Organise your double-sided A4 Summary Sheet for the test. Visit this link: http://www.purecoder.net/mathsguru/sixthform.htm Scroll down to N to access worksheets on:
Prim's and Kruskal's algorithms. The Chinese postman algorithm. Shortest route problems (Djikstra's algorithm). You may create your own questions on networks here:

http://www.geogebra.org/en/upload/files/english/jw elker/Discrete_TSP_5_cities2.html

Forum

Not this week.

Quiz

Not this week.