Difference between revisions of "D1 Route Inspection"
(Created page with "Part of D1 == Objectives == <onlyinclude> * </onlyinclude> == Preparation == == Supporting activities == == Consolidation == == Homework == == Key questions == == Assessme...") |
(→Supporting activities) |
||
| (2 intermediate revisions by one other user not shown) | |||
| Line 2: | Line 2: | ||
== Objectives == | == Objectives == | ||
<onlyinclude> | <onlyinclude> | ||
| − | * | + | *Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes |
</onlyinclude> | </onlyinclude> | ||
| + | |||
== Preparation == | == Preparation == | ||
== Supporting activities == | == Supporting activities == | ||
| + | [[File:Route_inspection.pdf]] | ||
| + | |||
== Consolidation == | == Consolidation == | ||
== Homework == | == Homework == | ||
| Line 11: | Line 14: | ||
== Assessment == | == Assessment == | ||
== Notes == | == Notes == | ||
| + | Consider all pairings of odd nodes by inspection. | ||
Latest revision as of 09:17, 11 July 2014
Part of D1
Contents
Objectives
- Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex. The network will have up to four odd nodes
Preparation
Supporting activities
Consolidation
Homework
Key questions
Assessment
Notes
Consider all pairings of odd nodes by inspection.
