Register
Dark Mode

GO Classes 2023 | IIITH Mock Test 1 | Question: 22

in Computer Networks edited by
578 views
1 vote
1 vote

Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$

If the network follows link state routing algorithm to determine next hop for least cost path then which constraints on $x$ and $y$ guarantee traffic from $\text{B}$ to $\text{C}$ will always flow through node $\text{A}?$

  1. $x>4$
  2. $y+x<6$
  3. $y+x<4$
  4. $x<4$
in Computer Networks edited by
by
578 views

1 comment

by
How ans is C?

if we take x=2,y=1

then we r getting BDAC=7 and BAC=8

anyone explain this !!
0
0

1 Answer

2 votes
2 votes
There are 3 path from B to C,

BAC(6+X) ,BDAC(4+X+Y),BDEC(8)

NOW WE WANT PATH ALWAYS THROUGH A HENCE 6+X<8 AND 4+X+Y<8

WHICH MEANS X<2 AND X+Y<4

HENCE C IS MOST STRONG ANSWER.
by

1 comment

by
ok got it thnx
0
0
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!