quiz

Routing Algorithms

1. Which routing scheme delivers a message to all nodes in the network using a one-to-all association?

  • A) Unicast
  • B) Broadcast
  • C) Multicast
  • D) Anycast
B) Broadcast Explanation

2. What term describes the condition in which all nodes in a network have updated and consistent routing tables?

  • A) Synchronization
  • B) Stabilization
  • C) Convergence
  • D) Equilibrium
C) Convergence Explanation

3. Which of the following protocols is used for inter-domain routing on the Internet?

  • A) OSPF
  • B) RIP
  • C) BGP
  • D) EIGRP
C) BGP Explanation

4. In a packet-switched network, what is the role of intermediate network nodes?

  • A) To forward packets from one network interface to another
  • B) To provide IP addresses to devices
  • C) To store data packets temporarily
  • D) To encrypt data packets
A) To forward packets from one network interface to another Explanation

5. Which algorithm is commonly used in link-state routing protocols to find the shortest path?

  • A) Bellman-Ford
  • B) Dijkstra's
  • C) Floyd-Warshall
  • D) Kruskal's
B) Dijkstra's Explanation

6. Which routing protocol is optimized for mobile ad hoc networks and uses Hello and TC messages?

  • A) RIP
  • B) EIGRP
  • C) OSPF
  • D)  OLSR
D) OLSR Explanation

Quick Links