• retagged by
2,401 views
0 0 votes

Is this question and solution both are wrong?

2 Answers

1 1 vote
Question is fine and the answer is C.

C's present routing table is like - (∞,6,0,3,5,∞) [Assuming its second iteration]

On receiving B as -(15,0,18,12,16) & D as- (16,12,6,0,9,10) & E as- (17,16,13,19,0,14)

C will attempt to minimize its delays to A-

Using B For A, delay of C-B=6 & B-A=15, total=6+15=21, Since ∞>21, Update C's table as  (21,6,0,3,5,∞)

Using D For A, delay of C-D=3 & D-A=16, total=3+16=19, Since 21>19, Update C's table as  (19,6,0,3,5,∞)

Using E For A, delay of C-E=5 & E-A=17, total=5+17=22, Since 19<22, No Update in C's table (19,6,0,3,5,∞)

Similarly minimize delays to F-

Using B For F, delay of C-B=6 & B-F=16, total=6+16=22, Since ∞>22, Update C's table as  (19,6,0,3,5,22)

Using D For F, delay of C-D=3 & D-F=10, total=3+10=13, Since 22>13, Update C's table as  (19,6,0,3,5,13)

Using E For F, delay of C-E=5 & E-F=14, total=5+14=19, Since 13<19, No Update in C's table (19,6,0,3,5,13)

Final table- (19,6,0,3,5,13)

P.S- I have skipped checking for B,D,E as they are already minimum, but they should be checked in each iteration.
Position:
Show:

Related questions

3 3 votes
1 1 answer
664
664 views
_Droid asked Dec 23, 2024
664 views
According to me, A is false : They only send Distance vector to neighbouring routerB is false: similarly to A , and updates are only sent to neighboring router and not ev...
1 1 vote
0 0 answers
245
245 views
Shubham Sharma 2 asked Sep 10, 2025
245 views
Match List I with List II$\begin{array}{|ll|ll|} \hline & \textbf{List I} & & \textbf{List II} \\ \hline \text{A.} & \text{Count to infinity problem} & \text{I.} & \text{...
1 1 vote
0 0 answers
242
242 views
Shubham Sharma 2 asked Sep 9, 2025
242 views
Which of the following statement/s is/are NOT CORRECT?$\textrm{OSPF}$ is based on distance-vector routing protocol.Both link-state and distance-vector routing are based o...
1 1 vote
1 1 answer
358
358 views
gopal_gate asked May 17, 2025
358 views
Distance-Vector Routing Algorithm written in FOROUZAN:Distance_Vector_Routing ( ) { // Initialize (create initial vectors for the node) D[myself] = 0 for (y = 1 to N) { i...