Which of the following statement are true for link state routing A. Link state…

2026

Which of the following statement are true for link state routing

A. Link state Routing is suffer from count-to-infinity problem.

B. Link state Routing uses flooding in the network to distribute link state packets.

C. Each router creates its own link state packet.

D. Every router has exactly the same link state database.

E. Each router finds its own shortest paths to the other routers by using distance vector routing.

Choose the correct answer from the options given below:

  1. A & E Only

  2. B, C & D Only

  3. A, B, C & D Only

  4. A, B & E Only

  1. A.

    1

  2. B.

    2

  3. C.

    3

  4. D.

    4

Attempted by 81 students.

Show answer & explanation

Correct answer: B

The correct answer is B, C & D Only. Statement A is false because link state routing does not suffer from the count-to-infinity problem—this issue occurs in distance vector protocols. Statement B is true: link state routing uses flooding to distribute link state packets across the network. Statement C is correct because each router generates its own link state packet (LSP). Statement D is true since all routers in the network maintain identical link state databases. Statement E is false because shortest paths are computed using Dijkstra's algorithm, not distance vector routing. Therefore, the correct options are B, C, and D.

Explore the full course: Tpsc Assistant Technical Officer