Discussion
What is the routing algorithm used by RIP and IGRP ?
Answer: D
The key gives option (D), a garbled form of the distance vector algorithm.
RIP and IGRP are both distance vector protocols, in which each router tells its neighbours its distances to all networks and uses the Bellman-Ford method. OSPF (A) and link-state (B) are the other family, in which routers share link information and run Dijkstra's algorithm, and 'dynamic' (C) describes how routes are learnt, not an algorithm. The printed words 'Dijkestra vector' are not a real algorithm, and (D) is the only option that names a vector method, so the answer follows the key.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development