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?
More IT Networking Questions
- What is the primary purpose of virtual memory in a computer system?
- How can the Banker's algorithm be used to prevent deadlocks?
- What is the purpose of the "GROUP BY" clause in an SQL query?
- In CRC-based error detection, given data bits 1101011011 and a generator polynomial represented in binary as 10011 (degree 4), what is the resulting CRC ch...
- Which is not in relation to the database.
- In Generative Adversarial Networks (GANs), which component generates realistic data samples?
- In a LAN, what is a common device used to connect multiple segments or networks and make forwarding decisions based on MAC addresses?
- What is 'SIEM' (Security Information and Event Management)?
- What is the primary purpose of Network Address Translation (NAT)?
- When does the "commit" operation in a transaction take place?
Relevant for Exams:
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)