CHECK TEST 2

NETWORKS

COMPLETING AND UNDERSTANDING QUESTIONS = EXAM SUCCESS USE IT FOR

REVISION.
IF YOU DO NOT DO THE WORK NOBODY CAN HELP YOU.
HAND IN WHEN COMPLETED
Name..
1. Draw the following building plan as a network. Show the outside as one node and
the doorways as connections between rooms.

[1]

2. a. Demonstrating the use of a network algorithm to find a minimum spanning tree in

the following network.
b. Calculate the length of the minimum spanning tree.
[2]

3. a.
b.
c.

Demonstrating the use of a network algorithm to find a minimum spanning

tree in the following network.
For the network drawn below, find the shortest path from a to l.
Determine the length of this path.

[3]

4 a. For the network drawn below, find the shortest path from g to k including c.
b. Determine the length of this path.

[3]

a. Represent this information as a network.

b. Use an algorithm to determine the cheapest link between H and E.
[3]

Note that the memo is highly confidential and cannot be copied or emailed!

[3]