Which of the following statement/s is/are NOT CORRECT?

(A) OSPF is based on distance-vector routing protocol.

(B) Both link-state and distance-vector routing are based on the least cost goal.

(C) BGP4 is based on the path-vector algorithm.

(D) The three-node instability can be avoided using split horizon combined with poison reverse.

(E) RIP is based on link state algorithm.

Choose the correct answer from the options given below:

This question was previously asked in
UGC NET Computer Science (Paper 2) 07 Dec 2023 Official Paper
View all UGC NET Papers >
  1. (A), (D) and (E) Only
  2. (A) and (B) Only
  3. (B) and (C) Only
  4. (B), (C) and (E) Only

Answer (Detailed Solution Below)

Option 1 : (A), (D) and (E) Only
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
10.8 K Users
50 Questions 100 Marks 60 Mins

Detailed Solution

Download Solution PDF

The correct answer is (A), (D) and (E) Only

EXPLANATION:

  • (A) OSPF is based on distance-vector routing protocol. -
    • This statement is NOT CORRECT. OSPF (Open Shortest Path First) is based on a link-state routing protocol, not a distance-vector protocol.
  • (B) Both link-state and distance-vector routing are based on the least cost goal. -
    • This statement is CORRECT. Both of these protocols seek the path with the least overall "cost," where cost is a value that represents characteristics like bandwidth, delay, reliability, etc.
  • (C) BGP4 is based on the path-vector algorithm. -
    • This statement is CORRECT. The Border Gateway Protocol (BGP) version 4 is based on a path-vector algorithm rather than being purely distance-vector or link-state.
  • (D) The three-node instability can be avoided using split horizon combined with poison reverse. -
    • This statement is NOT CORRECT. Both split horizon and poison reverse are methods to prevent routing loops in distance-vector protocols; however, they might not always be able to prevent "count-to-infinity" problems, including certain cases of three-node instability.
  • (E) RIP is based on link state algorithm. -
    • This statement is NOT CORRECT. The Routing Information Protocol (RIP) is based on a distance-vector algorithm, not a link-state algorithm.
Latest UGC NET Updates

Last updated on Jun 11, 2025

-> The UGC NET Exam Schedule 2025 for June has been released on its official website.

-> Check UPSC Prelims Result 2025, UPSC IFS Result 2025, UPSC Prelims Cutoff 2025, UPSC Prelims Result 2025 Name Wise & Rollno. Wise

-> The UGC NET Application Correction Window 2025 is available from 14th May to 15th May 2025.

-> The UGC NET 2025 online application form submission closed on 12th May 2025.

-> The June 2025 Exam will be conducted from 21st June to 30th June 2025

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Router and Routing Algorithm Questions

More IPv4/IPv6, Routers and Routing Algorithms Questions

Get Free Access Now
Hot Links: teen patti master teen patti master 2023 teen patti flush teen patti master old version teen patti master real cash