Unit 1 Section 4 : Networks
In this section we consider networks.
A network is a system of points with distances between them. A network can represent roads, pipelines, cables etc.
Typical problems with networks involve finding the shortest path between one point in the network and another.
For example, a driver might use a network of distances between places to find the shortest route between two places.
The slideshow below shows an example of finding a "shortest route". Use the left and right arrows to view the slideshow.
Example 1
It can be helpful to cross off paths which are no longer needed as you go along.
You can cross off a path to a particular point if you have already found a shorter
route to that point. The example below shows you how to do this in practice.
Example 2
Exercises
Work out the answers to the questions below and fill in the boxes. Click on the
button to find out whether you have answered correctly. If you are right
then will appear and you should move on to the next
question. If appears then your answer is wrong. Click
on to clear your original answer and have another go.
If you can't work out the right answer then click on
to see
the answer.
You may find it helpful to print out this page, so you can
write on the networks while you are working out the answers.
You have now completed Unit 1 Section 4
Since these pages are under
development, we find any feedback extremely valuable. Click
here to fill out a very short form which allows you make comments about
the page, or simply confirm that everything works correctly.

Return to the Y8 Tutorials Menu
Produced by A.J. Reynolds January 2003
>