Question
Consider the following three statements about link state
and distance vector routing protocols, for a large network with 500 network nodes and 4000 links [S1] The computational overhead in link state protocols is higher than in distance vector protocols. [S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol. [S3] After a topology change, a link state protocol will converge faster than a distance vector protocol. Which one of the following is correct about S1, S2, and S3?Solution
S1 and S3 are true and S2 is false
Statements : Z < S < W < D; E ≤ C ≤ Y < D; U < T < S ≤ V
Conclusions :
I. V > Z
II. C < U
III. V > E
Statements: H ≥ D = R > I < M > U > P ≤ N
Conclusion I: H > R
II: P < M
Statements: Q ≥ R > U; R ≤ S; U ≥ B
Conclusions: I. B < R II. B ≤ Q
Statements: B % L, L & Y, Y @ I, I # Q
Conclusions: I. Q & Y II. B # I
...Statements: W ≤ T = R; T < U < S; X = W ≥ Y
Conclusions:
I. S > Y
II. W ≥ S
III. U ≥ Y
Statements:O < P,P < Q,Q < R
Conclusions: I. P < R II. P > Q
In the question, assuming the given statements to be true, find which of the conclusion (s) among given two conclusions is /are definitely true and the...
In the question, assuming the given statements to be true, find which of the conclusion (s) among given three conclusions is /are definitely true and t...
Statements: A ≥ B > C ≥ D < E < F < G
Conclusions: I. A > D II. G > C
...In which of these expression ‘O ≤ F’ is definitely true?
Relevant for Exams:
