Test series

Question

Consider the network given below :

Each node in the graph represents the router. Each node maintains its routing table to send a packet to its destination with minimum cost. Initially routing table is empty. The table is filled as every node knows only the distance to the immediate neighbour. What will be the routing table ‘F’ after each node has twice reported the information it had in the proceeding steps in its immediate neighbours?

Answer 1

C) According to shortest path Algorithm

Answer 2

Using options

F has E as direct neighbor and min. path is 3 only so eliminate d as it has 5 cost for F->E

F has C as direct neighbor,so it know to reach F,it can not be infinite so eliminate a option.

Now b and c differ only in A entry,and after two iterations E has path to reach A which it will share with F,so F knows how to reach A and with 6 length path.

So this eliminates b

c should be correct answer here.