Register

ME test

• edited by
326 views
0 0 votes

Consider a network systems having 4 routers P, Q, R and S as shown below. Initially, the routers use a distance vector routing, and use the number of hops as the distance metric.

Initially, link P-Q was down, and all routers agree P is unreachable. The link P-Q comes back up. Let ' $x$ ' be the number of exchange needed by router $P$ to stabilize its table having distance to all other router in the network. Assume the routers all exchange messages at the same instant. After reaching a steady-state the link P-Q goes down again. Let ' $y$ ' be the number of exchanges need for all routers to concluded router $P$ is unreachable. What are the values of ' $x$ ', ' $y$ ' respectively ?

  1. * 3, 5
  2. 5,7
  3. 4,6
  4. $\cup 4,7$

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Time ComplexityNext → · MadeEasy Test Series...
← Previous in category · Tcp congestion contr...Next in category → · MadeEasy Test Series...
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
1.6k
1.6k views
Rajesh Raj asked Dec 15, 2016
1,610 views
me test
An upper layer packet is split into 20 frames each of which has 80 percentchance of arriving undamaged. No error control is done by data link layer. Thenumber of times me...
1 1 vote
0 0 answers
722
722 views
saurabh rai asked Nov 3, 2016
722 views
ME test
Suppose you needed to use HTTP to download a webpage with three embeddedimages. The total number messages saved between the client and serverstarting from initiates TCP c...
0 0 votes
0 0 answers
694
694 views
saurabh rai asked Nov 2, 2016
694 views
ME test
Assume that X and Y are the only two stations on an Ethernet. Each has a steadyqueue of frames to send. Both X and Y attempt to transmit a frame, they wait toget the cont...
0 0 votes
1 1 answer
1.4k
1.4k views
tishhaagrawal asked Dec 4, 2023
1,392 views
MadeEasy Test Series 2024 - In this question they have asked about the number of context switches that are happening. (Excluding the first and the last context switch). I am getting the answer as 5, according to the answer key it should be 6. I am not pre-empting process P when Q arrives as P has a higher priority than Q, in the solutions they have done the exact opposite, can anyone please tell me whether my approach is correct or I am missing onto something.
Jobs $P, Q, R, S$ and $T$ with burst times equal to $13,10,5,9$ and 1 respectively arrive in $0,5,7,10,12$ seconds. Pre-emptive priority scheduling is utilized for schedu...