- Courses
- Tutorials
- Jobs
- Practice
- Contests
Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
Commerce
- Commerce
- Class 11 Accountancy Notes
- Class 12 Accountancy Notes
- Accountancy
- Class 11 Business Studies Notes
- Class 12 Business Studies Notes
- Business Studies
- Class 11 Microeconomics Notes
- Class 11 Statistics For Economics Notes
- Class 12 Macroeconomics Notes
- Class 12 Indian Economic Development Notes
- Economics
- Management
- Income Tax
- Finance
GATE | GATE-CS-2014-(Set-1) | Question 33
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 ?
(A)
S1, S2, and S3 are all true.
(B)
S1, S2, and S3 are all false.
(C)
S1 and S2 are true, but S3 is false
(D)
S1 and S3 are true, but S2 is false
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!
Last Updated :
Share your thoughts in the comments
GeeksforGeeks