------------------------------------------------------------------------------
CSC358 Tutorial 7 Notes

Question 1

(a) Review lecture slides for info.

(b) Each interface has an IP address

(c) Internet is a network of relatively small networks, so Dijkstra’s never
needs to run on a graph with N = billion, but only need to handle much smaller
graphs.

------------------------------------------------------------------------------

Question 2

11100000 00			-->		0
11100000 01000000	-->		1
1110000				-->		2
11100001 1			-->		3
otherwise			-->		3

------------------------------------------------------------------------------

Quesiton 3

After 6 steps, the shortest distances from x and predecessors of are:
t=7 u=6 v=3 w=6 y=6 z=8

------------------------------------------------------------------------------

Question 4

The final distance table is 

	u	v	x	y	z
v	1	0	3	3	5
x	4	3	0	3	2
z	6	5	2	5	0