# GATE2007-IT-60

26 votes
3.3k views

For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors, $A$, $E$, $D$ and $G$ as $8$, $10$, $12$ and $6$ msecs respectively and updates its routing table using distance vector routing technique.

$$\overset{\textbf{Routing Table of A}}{\begin{array}{|c|r|}\hline \text{A}&0\\ \hline \text{B}&40\\ \hline \text{C}&14\\ \hline \text{D}&17\\ \hline \text{E}&21\\ \hline \text{F}&9\\ \hline \text{G}&24\\ \hline \end{array}}\qquad \overset{\textbf{Routing Table of D}}{\begin{array}{|c|r|}\hline \text{A}&20\\ \hline \text{B}&8\\ \hline \text{C}&30\\ \hline \text{D}&0\\ \hline \text{E}&14\\ \hline \text{F}&7\\ \hline \text{G}&22\\ \hline \end{array}} \qquad \overset{\textbf{Routing Table of E}}{\begin{array}{|c|r|}\hline \text{A}&24\\ \hline \text{B}&27\\ \hline \text{C}&7\\ \hline \text{D}&20\\ \hline \text{E}&0\\ \hline \text{F}&11\\ \hline \text{G}&22\\ \hline \end{array}}\qquad \overset{\textbf{Routing Table of G}}{\begin{array}{|c|r|}\hline \text{A}&21\\ \hline \text{B}&24\\ \hline \text{C}&22\\ \hline \text{D}&19\\ \hline \text{E}&22\\ \hline \text{F}&10\\ \hline \text{G}&0\\ \hline \end{array}}$$

1. $$\begin{array}{|c|r|} \hline \text {A} & \text{8} \\\hline \text {B} & \text{20} \\\hline \text{C} & \text{17} \\\hline \text{D} & \text{12} \\\hline \text {E} & \text{10} \\\hline \text {F} & \text{0} \\\hline \text{G} & \text{6} \\\hline \end{array}$$
2. $$\begin{array}{|c|r|} \hline \text {A} & \text{21} \\\hline \text {B} & \text{8} \\\hline \text{C} & \text{7} \\\hline \text{D} & \text{19} \\\hline \text {E} & \text{14} \\\hline \text {F} & \text{0 } \\\hline \text{G} & \text{22} \\\hline \end{array}$$
3. $$\begin{array}{|c|r|} \hline \text {A} & \text{8} \\\hline \text {B} & \text{20} \\\hline \text{C} & \text{17} \\\hline \text{D} & \text{12} \\\hline \text {E} & \text{10} \\\hline \text {F} & \text{16} \\\hline \text{G} & \text{6} \\\hline \end{array}$$
4. $$\begin{array}{|c|r|} \hline \text {A} & \text{8} \\\hline \text {B} & \text{8} \\\hline \text{C} & \text{7} \\\hline \text{D} & \text{12} \\\hline \text {E} & \text{10} \\\hline \text {F} & \text{0} \\\hline \text{G} & \text{6} \\\hline \end{array}$$

edited
0
how we get 17 for c?

## 5 Answers

32 votes

Best answer

Answer: (A)

Distance from $F$ to $F$ is $0$ which eliminates option (C).

Using distance vector routing protocol, $F \to D \to B$ yields distance as $20$ which eliminates options (B) and (D).

edited by
0
@Rajarshi Can you please explained how you are calculated Distance F -> D -> B is 20.
3
^F To D is given in question as 12 and D to B can be found from table of D i.e. 8. So total F-D-B is 12+8 =20.
35 votes

ANS: A

0
cool :)
0
Can u explain it ??
0
he already did, what else u want..?
0
nice
0
D to F is given 7. why are we getting F to D 12.
4

@vishalshrm539 I found your comment very rude and distasteful. Everyone has varying comprehensible capabilities, and if you can genuinely help, please do so, otherwise, let others help and refrain from making unnecessary remarks.

1

@vishar Consider all distances as edge weights in a bidirectional graph. D to F being $7$ does not necessarily mean that F to D will be $7$ as well. In fact, F to D is given as $12$ in the question.

1
Should be best solution
0

@Puja Mishra Just take any 1 option and verify others. In above question he took example of option A, considered its neighbour and verified for other nodes. Hope it helps.

0 votes
ans a)
0 votes

Basically it is a bidirectional weighted graph. The directed weights are obtained from the routing tables of the respective source to destinations. We need to calculate the shortest path from F to each node based on the distances from the routing tables.

(A) is the answer.

–4 votes

Answer (A).

Answer:

## Related questions

0 votes
2 answers
1
902 views
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is allowed to send one frame of fixed size. Ring latency is tp, while the transmission time of a frame is tt. All other latencies ... maximum utilization of the token ring when tt = 5 ms, tp = 3 ms, N = 15 is: 0.545 0.655 0.9375 0.961
0 votes
2 answers
2
1.5k views
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is allowed to send one frame of fixed size. Ring latency is tp, while the transmission time of a frame is tt. All other latencies ... The maximum utilization of the token ring when tt =3 ms, tp = 5 ms, N = 10 is 0.545 0.6 0.857 0.961
22 votes
3 answers
3
6.7k views
You are given the following four bytes : 10100011 00110111 11101001 10101011 Which of the following are substrings of the base $64$ encoding of the above four bytes? $\text{zdp}$ $\text{fpq}$ $\text{qwA}$ $\text{oze}$
20 votes
2 answers
4
2.4k views
Consider the following clauses: Not inherently suitable for client authentication. Not a state sensitive protocol. Must be operated with more than one server. Suitable for structured message organization. May need two ports on the serve side for proper operation. The option that has the maximum number of ... -v POP3-i; SMTP-ii; DNS-iii; IMAP-iv; HTTP-v SMTP-i; HTTP-ii; IMAP-iii; DNS-iv; FTP-v