Cisco Systems Interview Question for Software Engineer in Tests






Comment hidden because of low score. Click to expand.
7
of 7 vote

1. RIP will not work for network having having hop count greater than 15 in any path because infinity is defined as 16 in RIP.


2. RIP is good for small,stable and High Speed Networks while OSPF is good for large Dynamic Networks.


3. RIP sends entire routing tale from router to router every 30 seconds(hence Consumes lot of bandwidth) while OSPF sends it's link state info every 30 minutes.OSPF routers also send each other small update message when they detect a change in network,moreover when routers exchange updates that reflect changes in the network they converge on a new representation of the topology quickly and accurately.


4. RIP has slow convergency in large networks while it is faster in OSPF.In larger networks OSPF network is divided into logical Subdivisions called OSPF area.OSPF routers with in one area do not exchange topology updates with routers of other area(limited with in their area only)OSPF areas are connected by a backbone that is an area itself.A roiter that connects it's area to the backbone must maintain a topology database for both areas.Area border routers communicate with each other using special link message that contain short hand summarization of their respective topologies.

The above reasons supports OSPF over RIP

- Dreamer January 05, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

In general I'd prefer OSPF to RIP - because I think OSPF is based on Dijkstra, and RIP is based on Bellman Ford. Former is O(n^2) or O(nLOGn) and latter is O(n^3). Bellman Ford is useful if there are -ve distances (weights) on node-node connections.

- acoder September 02, 2008 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Scratch my previous answer. I found some correct answers here: http://www.networkcomputing.com/unixworld/feature/002.html
Also, to correct some other mistatements above, Dijkstra is O(m*LOGn) or O(m+LOGn) where m is number of edges, n is number of nodes, and Bellman Ford is O(mm).

- acoder September 03, 2008 | Flag
Comment hidden because of low score. Click to expand.
-1
of 1 vote

I think OSPF would be better, because in RIP (vector distance) every node that is 16 hops away is consider to be infinity (unreachable), since the loop issue.

- Teng March 14, 2011 | Flag Reply
Comment hidden because of low score. Click to expand.
1
of 1 vote

In RIP by 16 hop you mean that between any two nodes you cannot have more than 16 routers. So, reasoning by you is no correct.

- Dreamer January 04, 2012 | Flag


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More