At the beginning of the Networks and Paths unit, students will be instructed to create a 'Trip Log', containing the following items:

• REQUIRED: Networks and Paths terminology definitions and accompanying diagram examples

• Recommended (but not assessed): Examples of real-world networks (covered in class and from research for Part 2), and evidence of research and analysis for Part 2 (Group Presentation)

These items should be collected within a separate book or folder and can include written, drawn or printed notes. A digital Trip Log is also acceptable, but must be sent via email to the teacher before the start of the Presentation Day lesson.

At the end of each lesson, students will be told what new terminology they must add to their trip logs. It is up to students to find or write their own definitions, draw their own diagrams, and conduct their own research. Students are encouraged to include examples of real-world networks presented in class in their Trip Log.

Students will be awarded up to 20 marks for providing definitions and diagram examples for the following terminology:

• Network, network diagram, vertex, edge, degree (of a vertex), loop, multiple edges, simple network, connected network, weighted edges, directed edges, walk, trail, cycle, path, tree, (minimum) spanning tree, Prim's algorithm, Kruskal's algorithm, Dijkstra's algorithm

The intention of this assessment component is to help students compile notes for the Network and Paths topic.

During the Networks and Paths unit, students will work in groups (of 4) to research a real-world network (natural or human-based), and prepare a presentation of their findings and analysis in whatever medium they have selected to communicate within (e.g. video, poster, report, speech, role-play, classroom activity, drawing, model, website).

Groups will be marked on how well they complete the following items (as well as their overall presentation style):

1. identify what real-world network they have selected to research

2. provide an overview of the network

3. identify the number of vertices and edges in the network

4. explain what the vertices and edges represent in the network

5. explain (with examples) what the degree of a vertex represents in the network

6. provide a simplified, labelled network diagram

7. propose and solve a problem involving the network using an algorithm

A list of network ideas will be given to students at the start of the unit, but they are expected to conduct their own additional research and to be creative in their presentations.

Students will have 7-10 minutes to present, and will be asked questions from peers and the teacher at the end of their presentation.

The teacher's role during the final lesson (Presentation Day) will be to:

• facilitate students' presentations (e.g. assisting students in manipulating class space, encouraging students to ask questions);

• provide marks and feedback to presenters when they have finished;