Topic

Dijkstra

2 questions in this topic.

2014 Q3(f)Network Layer / IPDijkstra· 5 marks

Dijkstra’s algorithm can be implemented in two different ways, one of which has a complexity of O(n2) and one of which has a complexity of O(n log n). Choose one of the implementations and briefly justify its complexity.

routingcomplexity

Open question →

2015 Q3(a)Network Layer / IPDijkstra· 6 marks

Given the network shown above, show the development of the routing table for node A using Dijkstra’s algorithm. You must show your work and the final routing table (next hop and path cost for each destination) for full marks.

link stateshortest path

Open question →