Question 1.

1. d
2. d
3. a
4. d
5. c
6. c
7. c
8. c
9. b
10. d
11. d
12. d
13. c
14. b
15. b
16. a
17. d
18. b
19. c
20. d
21. d
22. b
23. c
24. a
25. b
------

a)
i)
A minimum spanning tree (MST) is a spanning tree (subgraph that includes all no
des) of a connected weighted graph G, whose total edge-weight is minimum.
ii)
The first step in finding the MST using Kruskal's algorithm is to check whether
all nodes are part of a connected graph. In this case, all of them are connected
.
Next, the edges are sorted in ascending order of weight.
21
25
26
27
29
30
31
Next, each node is marked as a separate component.
Show diagram of all nodes without edges
Then, starting with the edge with the least weight, we check whether it connects
two components that are not already connected in a graph.
21 connects two nodes that are not alredy part of the graph => attach the edge.
Show diagram
Next, 25 is examined and also passes this check.
Show diagram
Next, 26 is examined, but it does not pass the check as both nodes are already c
onnected.
Next, 27 is examined, passes the check and is thus added to the graph.
Show diagram
Next, 29 is examined, passes the chck and is thus added to the graph.
Show diagram
Next, 30 is examined, fails the ckeck as both nodes are connected.
Finally, 31 is examined, fails the check as both nodes are already connected. Si
nce all nodes are already part of the graph, the Kruskal algorithm finishes. The
final MST graph is shown below:
Show diagram
iii)
In this case, the process is exactly the same until the step where the edge with
a weight of 30 is examined. After it fails the check, the edge with a weight of
31 is examined, passes the check since one of the nodes is not already connecte
d.
Show diagram
Finally, the edge with a weight of 32 is examined and does not pass the check as
both nodes are already part of the graph. The Kruskal's algorithm is completed.
Show diagram
------
Firewall question:
c)
i) yes
ii) no
iii) yes
iv) no
v) no
vi) no
vii) yes
viii) no
ix) no
x) no
------
Question 2 (2008/2009).
a)
i)
This type of topology is referred to as a tree (a simple connected graph without
cycles). The degree of node X is two.
ii)
Show graph.
This topology is still a tree, but can also be further classified as a chain bec
ause no node has a degree larger than 2.
Topology is star in 2010/2011 sample paper.
iii)
Show graph.
The resulting topology is referred to as tour because each node has a degree of
two and the graph is connected. The degree of node X is still two.