N1.1 Networks

Students:

• identify and use network terminology: vertices, edges, paths, the degree of a vertex, directed networks and weighted edges

Focus: introducing the key terminology and visual representation of networks: network diagrams, vertices, edges, degree (of a vertex); assessment introduced

N1.1 Networks

Students:

• identify and use network terminology: vertices, edges, paths, the degree of a vertex, directed networks and weighted edges

• solve problems involving network diagrams AAM

  • recognise circumstances in which networks could be used, e.g. the cost of connecting various locations on a university campus with computer cables

Focus: students drawing simple graphs and using network terminology to describe networks

N1.1 Networks

Students:

• identify and use network terminology: vertices, edges, paths, the degree of a vertex, directed networks and weighted edges

• solve problems involving network diagrams AAM

  • recognise circumstances in which networks could be used, e.g. the cost of connecting various locations on a university campus with computer cables

Focus: students drawing more complicated network diagrams, involving directed edges, from images and worded descriptions

N1.1 Networks

Students:

• identify and use network terminology: vertices, edges, paths, the degree of a vertex, directed networks and weighted edges

• solve problems involving network diagrams AAM

  • recognise circumstances in which networks could be used, e.g. the cost of connecting various locations on a university campus with computer cables

  • given a map, draw a network to represent the map, e.g. travel times for the stages of a planned journey

Focus: network diagrams with weighted edges (and different network representations: maps and tables)

N1.1 Networks

Students:

• identify and use network terminology: vertices, edges, paths, the degree of a vertex, directed networks and weighted edges

• solve problems involving network diagrams AAM

  • recognise circumstances in which networks could be used, e.g. the cost of connecting various locations on a university campus with computer cables

  • given a map, draw a network to represent the map, e.g. travel times for the stages of a planned journey

  • draw a network diagram to represent information given in a table

Focus: further network problems (involving different representations)

N1.1 Networks

Students:

• identify and use network terminology: vertices, edges, paths, the degree of a vertex, directed networks and weighted edges

• solve problems involving network diagrams AAM

  • recognise circumstances in which networks could be used, e.g. the cost of connecting various locations on a university campus with computer cables

  • given a map, draw a network to represent the map, e.g. travel times for the stages of a planned journey

Focus: further network problems (consolidation before starting trees)

N1.2: Shortest Paths

Students:

• determine the minimum spanning tree of a given network with weighted edges AAM

  • determine the minimum spanning tree by using Kruskal's or Prim's algorithm or by inspection

  • determine the definition of a tree and a minimum spanning tree for a given network

Focus: introducing trees, spanning trees and minimum spanning trees (which can be found using Prim's Algorithm)

N1.2: Shortest Paths

Students:

• determine the minimum spanning tree of a given network with weighted edges AAM

  • determine the minimum spanning tree by using Kruskal's or Prim's algorithm or by inspection

  • determine the definition of a tree and a minimum spanning tree for a given network

Focus: students find minimum spanning trees in networks using Kruskal's algorithm

N1.2: Shortest Paths

Students:

• find a shortest path from one place to another in a network with no more than 10 vertices AAM

  • identify a shortest path on a network diagram

  • recognise a circumstance in which a shortest path is not necessarily the best path or contained in any minimum spanning tree

Focus: students find the shortest path between two vertices in a network diagram using method if inspection

N1.2: Shortest Paths

Students:

• find a shortest path from one place to another in a network with no more than 10 vertices AAM

  • identify a shortest path on a network diagram

  • recognise a circumstance in which a shortest path is not necessarily the best path or contained in any minimum spanning tree

Focus: students find the shortest path between two vertices in a network diagram using Dijkstra's algorithm

See: Syllabus and Assessment

Focus: students present their research of a real-world network and their complete Trip Log (vocabulary)

Also see: Resources

Focus: supplementary lesson or activity ideas for teaching about networks and paths