Nayland College

Nayland College - Mathematics

Home . Year 9 . Year 10 . Level 1 . Level 2 . L3 Statistics . L3 Maths . L3 Calculus . About . Links

NZAMT NZQA NZ Grapher NZ Maths Census at School Study It

2.5 Networks AS 91260

2.5 Networks HOME | Overview | Achievement Criteria | Traversability | Shortest Path | Hamilton Circuit & Travelling Salesman | Minimum spanning tree | Forming a network from a table | Revision

Lesson Sequence for 2.5 Networks AS 91260

1. Overview, definitions, investigate traversability
2. Achievement Criteria
3. Traversability
4. Shortest Path
5. Minimum spanning tree
6. Forming a network from a table
7. Revision
8. Assessment

Workbooks needed: ($6 to $7 each) NuLake

For Teachers

AS 2.5 Networks AS 91260 (2 credit internally assessed)

* Be familiar with the Achievement Standard 2.5 #91268 (link to NZQA)

* Check the latest information on the NZQA clarifications page as things change all the time, and the exemplars in NZQA may be out of date (as they are in this standard)

* Look over the NZQA Exemplars AS2.5 A & AS2.5 B

* Any further ideas / suggestions / resources/ comments / errors. Please email maxr@nayland.school.nz

* AS 2.5 section on Nayland Web site updated: Jan 2015

 

Web links for 2.5 Networks AS 91260

http://www.mhhe.com

back to top