Computer Science · Computer Networks
Which of the following statements are true for link-state routing? A. Link-state routing suffers from the 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 builds exactly the same link-state database. E. Each router finds its own shortest paths to other routers by using distance-vector routing. Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A & E Only
- 2B, C & D Only✓
- 3A, B, C & D Only
- 4A, B & E Only
Correct answer
B, C & D Only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Computer Networks MCQs →Want more practice questions on Computer Networks?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Computer Networks