NEW
Font size
WorksheetsRouting Protocols MCQs
Total questions: 25
Worksheet time: 11mins
Which algorithm is most commonly used for finding the single-source shortest path in a weighted graph with non-negative weights?
Bellman-Ford
Dijkstra's algorithm
Floyd-Warshall
Kruskal's algorithm
Bellman-Ford algorithm can handle:
Only positive weights
Positive and negative weights (no negative cycles)
Only negative weights
Zero-weight edges only
The time complexity of Dijkstra's algorithm with a binary heap is:
O(V²)
O(E + V log V)
O(V log E)
O(E log E)
Which algorithm finds shortest paths between all pairs of vertices?
Prim's
Dijkstra's
Floyd-Warshall
Bellman-Ford
Relaxation in shortest path algorithms means:
Ignoring edges
Updating a distance estimate if a shorter path is found
Removing cycles
Pausing computation
The output of a shortest path algorithm is typically a:
Spanning tree
Routing table
Flow network
Hamiltonian cycle
A negative cycle in a graph implies:
Multiple optimal solutions
No well-defined shortest path
Minimum spanning tree is impossible
Faster convergence
In a weighted graph, edges can represent:
Only physical distance
Any cost metric such as delay or bandwidth
CPU usage
File size
Distance vector protocols exchange:
Complete topology maps
Vectors of destination distances to neighbors
Only default routes
Encryption keys
A well-known distance vector protocol for IP networks is:
OSPF
RIP
IS-IS
BGP (core mode)
RIP uses which metric for path cost?
Bandwidth
Delay
Hop count
Reliability
Distance vector routers periodically send updates:
Only when changes occur
At fixed intervals
Once a day
Only on startup
The 'count-to-infinity' problem is associated with:
Link-state routing
Distance vector routing
Path-vector routing
Source routing
Triggered updates in RIP occur when:
At midnight
A significant topology change happens
The router is idle
A timer expires
Distance vector routers know:
Entire network map
Only the next hop and distance
All link states
MAC addresses of all devices
Maximum RIP hop count of 16 means:
Infinite distance
Network diameter limited to 16 routers
16-bit metric
TTL = 16
Bellman-Ford is the theoretical basis for:
Link-state protocols
Distance vector routing
Path vector BGP
MPLS
A key feature of link-state routing is:
Routers flood link-state advertisements (LSAs)
Distance vectors only to neighbors
Hop-by-hop updates
Centralized control
Each OSPF router builds a:
Distance vector table
Link-state database (LSDB)
MAC forwarding table
Bridge ID list
OSPF areas are used to:
Encrypt traffic
Scale large networks
Increase hop count
Provide QoS
When a link changes state, OSPF routers:
Wait for a timer
Immediately flood an LSA
Reboot
Ignore until periodic update
Hello packets in OSPF are used to:
Advertise routes
Discover and maintain neighbors
Carry user data
Measure latency
Which protocol is known as a path-vector unicast routing protocol?
BGP
OSPF
RIP
IS-IS
Which of these is not an Interior Gateway Protocol?
OSPF
IS-IS
RIP
BGP
Unicast routing delivers packets:
To all nodes
To a single specific destination
To a multicast group
To broadcast domain
